Fast edge colorings with fixed number of colors to minimize imbalance

DOI10.7155/JGAA.00172MaRDI QIDQ5301445zbMATH OpenOpenAlexFDO

Authors Gruia Calinescu, Michael J. Pelsmajer

Publication date 19 January 2009

Published in Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL http://www.emis.de/journals/JGAA/accepted/2008/CalinescuPelsmajer2008.12.4.pdf

zbMATH Keywords

optimizationmaximum matching computations

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Fast Edge Colorings with Fixed Number of Colors to Minimize Imbalance
• A fast algorithm for computing a nearly equitable edge coloring with balanced conditions
• A Fast Algorithm for Computing a Nearly Equitable Edge Coloring with Balanced Conditions
• An Efficient Algorithm for the Nearly Equitable Edge Coloring Problem
• Fast algorithms for edge-coloring planar graphs
• Optimal edge-coloring with edge rate constraints
• A simple and fast heuristic algorithm for edge-coloring of graphs
• scientific article; zbMATH DE number 3889546
• Very fast parallel algorithms for approximate edge coloring
• Coloring Graphs with Minimal Edge Load

Cited in

(3)

• Fast Edge Colorings with Fixed Number of Colors to Minimize Imbalance
• Optimal edge-coloring with edge rate constraints
• Minimum multiplicity edge coloring via orientation

This page was built for publication: Fast edge colorings with fixed number of colors to minimize imbalance

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