Covering a tree by a forest

DOI10.1007/978-3-642-02029-2_7MaRDI QIDQ3655140zbMATH OpenOpenAlexFDO

Authors Fanica Gavril, Alon Itai

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

edge-cover of a tree by a forestgraph algorithmsvertex-cover of a tree by a forest

Mathematics Subject Classification ID

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

Recommendations

• Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques
• Packing and covering a tree by subtrees
• Matroids and a forest cover problem
• scientific article; zbMATH DE number 949664
• Covering a graph with a constrained forest (extended abstract)

Cites work

• Clique partitions, graph compression and speeding-up algorithms
• Combinatorial Pattern Matching
• 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
• scientific article; zbMATH DE number 3839975 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)

Cited in

(3)

• On star-cover and path-cover of a tree
• scientific article; zbMATH DE number 1439477 (Why is no real title available?)
• A tree-covering problem arising in integrity of tree-structured data

This page was built for publication: Covering a tree by a forest

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