Finding and counting vertex-colored subtrees

DOI10.1007/978-3-642-15155-2_36MaRDI QIDQ3586101zbMATH OpenOpenAlexFDO

Authors Sylvain Guillemot, Florian Sikora

Publication date 3 September 2010

Published in Mathematical Foundations of Computer Science 2010 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-15155-2_36

Mathematics Subject Classification ID

Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Coloring of graphs and hypergraphs (05C15)

Recommendations

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

Cited in

(7)

• Constrained multilinear detection and generalized graph motifs
• On the Kernelization Complexity of Colorful Motifs
• Finding approximate and constrained motifs in graphs
• Constrained multilinear detection for faster functional motif discovery
• Upper and lower bounds for finding connected motifs in vertex-colored graphs
• On the parameterized complexity of the repetition free longest common subsequence problem
• Finding and counting vertex-colored subtrees

This page was built for publication: Finding and counting vertex-colored subtrees

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