scientific article; zbMATH DE number 3889546

MaRDI QIDQ3222860zbMATH OpenFDO

Authors Mark K. Goldberg

Publication date 1984

zbMATH Keywords

multigraphquadratic edge-coloring algorithm

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• A better than “best possible” algorithm to edge color multigraphs
• An asymptotic approximation scheme for multigraph edge coloring
• Experimental and Efficient Algorithms
• 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
• Experimental and Efficient Algorithms

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)