An algorithm for minimum weight star covers of graphs

MaRDI QIDQ4982730zbMATH OpenFDO

Authors C. M. de Matas

Publication date 10 April 2015

zbMATH Keywords

forbidden subgraphsstar cover of a graph

Mathematics Subject Classification ID

Signed and weighted graphs (05C22) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques
• scientific article; zbMATH DE number 1837688
• scientific article; zbMATH DE number 5126095
• scientific article; zbMATH DE number 1878047
• A greedy heuristic for a minimum-weight forest problem

Cited in

(5)

• scientific article; zbMATH DE number 431487 (Why is no real title available?)
• scientific article; zbMATH DE number 5126095 (Why is no real title available?)
• scientific article; zbMATH DE number 1837688 (Why is no real title available?)
• scientific article; zbMATH DE number 1878047 (Why is no real title available?)
• Minimum rank and path cover number for generalized and double generalized cycle star graphs

This page was built for publication: An algorithm for minimum weight star covers of graphs

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