Experimental and Efficient Algorithms

DOI10.1007/B136461MaRDI QIDQ5710064zbMATH OpenOpenAlexFDO

Authors Martin Kochol, Nad'a Krivoňáková, Silvia Smejová

Publication date 30 November 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b136461

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)

Recommendations

• Edge-coloring of multigraphs
• A better than “best possible” algorithm to edge color multigraphs
• On the $1.1$ Edge-Coloring of Multigraphs
• scientific article; zbMATH DE number 3889546
• An asymptotic approximation scheme for multigraph edge coloring

Cited in

(13)

• Edge coloring nearly bipartite graphs
• New algorithm for calculating chromatic index of graphs and its applications
• Edge-coloring of multigraphs
• An asymptotic approximation scheme for multigraph edge coloring
• Improving a family of approximation algorithms to edge color multigraphs
• Vizing's coloring algorithm and the fan number
• scientific article; zbMATH DE number 3889546 (Why is no real title available?)
• Approximations for Aligned Coloring and Spillage Minimization in Interval and Chordal Graphs
• scientific article; zbMATH DE number 1947053 (Why is no real title available?)
• scientific article; zbMATH DE number 1998816 (Why is no real title available?)
• An asymptotic approximation scheme for multigraph edge coloring
• Efficient approximation algorithms for bandwidth consecutive multicolorings of graphs
• Complexity of approximation of 3-edge-coloring of graphs

This page was built for publication: Experimental and Efficient Algorithms

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