On the Complexity of the Max-Edge-Coloring Problem with Its Variants

DOI10.1007/978-3-540-74450-4_32zbMath1176.90521OpenAlexW1523036395MaRDI QIDQ3611926

Chang Wu Yu

Publication date: 3 March 2009

Published in: Combinatorics, Algorithms, Probabilistic and Experimental Methodologies (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-74450-4_32

zbMATH Keywords

edge coloringbipartite graphsalgorithm designmulti-graphs

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27) Coloring of graphs and hypergraphs (05C15) Approximation algorithms (68W25)

This page was built for publication: On the Complexity of the Max-Edge-Coloring Problem with Its Variants