Approximating Maximum Edge 2-Coloring in Simple Graphs

DOI10.1007/978-3-642-14355-7_9zbMath1286.05165OpenAlexW1482081738MaRDI QIDQ3578359

Zhi-Zhong Chen, Yuki Matsushita, Sayuri Konno

Publication date: 20 July 2010

Published in: Algorithmic Aspects in Information and Management (Search for Journal in Brave)

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

zbMATH Keywords

edge coloringgraph algorithmsapproximation algorithmsNP-hardness

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Coloring of graphs and hypergraphs (05C15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

Parameterized and approximation algorithms for finding two disjoint matchings

This page was built for publication: Approximating Maximum Edge 2-Coloring in Simple Graphs