Finding and Counting Vertex-Colored Subtrees
From MaRDI portal
Publication:3586101
DOI10.1007/978-3-642-15155-2_36zbMath1287.05150OpenAlexW2139715722MaRDI QIDQ3586101
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
Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (7)
On the parameterized complexity of the repetition free longest common subsequence problem ⋮ Finding and counting vertex-colored subtrees ⋮ Constrained multilinear detection for faster functional motif discovery ⋮ Finding Approximate and Constrained Motifs in Graphs ⋮ Upper and lower bounds for finding connected motifs in vertex-colored graphs ⋮ On the Kernelization Complexity of Colorful Motifs ⋮ Constrained multilinear detection and generalized graph motifs
This page was built for publication: Finding and Counting Vertex-Colored Subtrees
