scientific article; zbMATH DE number 3889546
From MaRDI portal
Publication:3222860
[For the entire collection see Zbl 0547.00011.] A quadratic edge-coloring algorithm is described, which for a given multigraph constructs a minimal coloring, unless the number of colors used does not exceed \((9/8)\rho +3/4\), where \(\rho\) is the maximum degree of a vertex.
Recommendations
- A better than “best possible” algorithm to edge color multigraphs
- An asymptotic approximation scheme for multigraph edge coloring
- Approximation algorithm for chromatic index and edge-coloring of multigraphs
- An asymptotic approximation scheme for multigraph edge coloring
- On the $1.1$ Edge-Coloring of Multigraphs
Cited in
(15)- Approximation algorithm for maximum edge coloring
- Three-quarter approximation for the number of unused colors in graph coloring
- A simple and fast heuristic algorithm for edge-coloring of graphs
- An asymptotic approximation scheme for multigraph edge coloring
- Improving a family of approximation algorithms to edge color multigraphs
- An Approximation Algorithm for the Smallest Color-Spanning Circle Problem
- An approximate algorithm for the (k,d)-coloring problem
- A better than “best possible” algorithm to edge color multigraphs
- An asymptotic approximation scheme for multigraph edge coloring
- Efficient algorithms for the edge-cover coloring problem
- Dynamic Edge Coloring with Improved Approximation
- An Efficient Algorithm for the Nearly Equitable Edge Coloring Problem
- Fast edge colorings with fixed number of colors to minimize imbalance
- Fast Edge Colorings with Fixed Number of Colors to Minimize Imbalance
- Approximation algorithm for chromatic index and edge-coloring of multigraphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3222860)