Approximation Algorithms for Maximum Edge Coloring Problem
From MaRDI portal
Publication:5425478
DOI10.1007/978-3-540-72504-6_59zbMath1162.68819OpenAlexW1567788322MaRDI QIDQ5425478
Wangsen Feng, Wanling Qu, Hanpin Wang, Li'ang Zhang
Publication date: 13 November 2007
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-72504-6_59
Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)
Related Items (3)
Approximation and hardness results for the maximum edge \(q\)-coloring problem ⋮ New bounds on the anti-Ramsey numbers of star graphs via maximum edge \(q\)-coloring ⋮ Complexity of Computing the Anti-Ramsey Numbers for Paths.
This page was built for publication: Approximation Algorithms for Maximum Edge Coloring Problem