Minimum cost edge-colorings of trees can be reduced to matchings

DOI10.1007/978-3-642-14553-7_26MaRDI QIDQ3587359zbMATH OpenOpenAlexFDO

Authors Takehiro Ito, Naoki Sakamoto, Xiao Zhou, Takao Nishizeki

Publication date 7 September 2010

Published in Frontiers in Algorithmics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-14553-7_26

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Coloring of graphs and hypergraphs (05C15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• scientific article; zbMATH DE number 1796973
• Algorithm for the cost edge-coloring of trees
• Minimum sum multicoloring on the edges of trees
• scientific article; zbMATH DE number 1759462
• Approximation and Online Algorithms

Cited in

(2)

• scientific article; zbMATH DE number 1796973 (Why is no real title available?)
• Algorithm for the cost edge-coloring of trees

This page was built for publication: Minimum cost edge-colorings of trees can be reduced to matchings

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