Some results on more flexible versions of Graph Motif

DOI10.1007/978-3-642-30642-6_26zbMATH Open1315.05062OpenAlexW2165803522MaRDI QIDQ2907508FDOQ2907508

Authors 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) Systems biology, networks (92C42) Coloring of graphs and hypergraphs (05C15)

Recommendations

• Some results on more flexible versions of Graph Motif
• The graph motif problem parameterized by the structure of the input graph
• Maximum Motif Problem in Vertex-Colored Graphs
• Finding and counting vertex-colored subtrees
• Finding approximate and constrained motifs in graphs

Cited In (9)

• The \(k\)-distinct language: parameterized automata constructions
• Finding and counting vertex-colored subtrees
• Approximation and hardness results for the maximum edges in transitive closure problem
• Finding approximate and constrained motifs in graphs
• Parameterized algorithms for the module motif problem
• Parameterized Algorithms and Hardness Results for Some Graph Motif Problems
• Partial information network queries
• The graph motif problem parameterized by the structure of the input graph
• Some results on more flexible versions of Graph Motif

This page was built for publication: Some results on more flexible versions of Graph Motif

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2907508)