Some Results on more Flexible Versions of Graph Motif

DOI10.1007/978-3-642-30642-6_26zbMath1315.05062OpenAlexW2165803522MaRDI QIDQ2907508

Romeo Rizzi, Florian Sikora

Publication date: 10 September 2012

Published in: Computer Science – Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-30642-6_26

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Coloring of graphs and hypergraphs (05C15) Systems biology, networks (92C42)

Related Items (5)

Parameterized algorithms for the module motif problem ⋮ Approximation and Hardness Results for the Maximum Edges in Transitive Closure Problem ⋮ Finding approximate and constrained motifs in graphs ⋮ Partial information network queries ⋮ The \(k\)-distinct language: parameterized automata constructions

This page was built for publication: Some Results on more Flexible Versions of Graph Motif