Covering a Tree by a Forest

DOI10.1007/978-3-642-02029-2_7zbMath1194.05145OpenAlexW1580892625MaRDI QIDQ3655140

Alon Itai, Fanica Gavril

Publication date: 7 January 2010

Published in: Graph Theory, Computational Intelligence and Thought (Search for Journal in Brave)

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

zbMATH Keywords

graph algorithmsedge-cover of a tree by a forestvertex-cover of a tree by a forest

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Clique partitions, graph compression and speeding-up algorithms
• Factoring and recognition of read-once functions using cographs and normality and the readability of functions associated with partial \(k\)-trees
• Faster Scaling Algorithms for Network Problems
• Faster Subtree Isomorphism
• Combinatorial Pattern Matching
• Unnamed Item
• Unnamed Item

This page was built for publication: Covering a Tree by a Forest