A Fast Algorithm for Computing a Nearly Equitable Edge Coloring with Balanced Conditions

DOI10.7155/JGAA.00213zbMATH Open1213.05099OpenAlexW2031581221MaRDI QIDQ3075615FDOQ3075615

Mutsunori Yagiura, Akiyoshi Shioura

Publication date: 16 February 2011

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

Full work available at URL: https://doi.org/10.7155/jgaa.00213

Mathematics Subject Classification ID

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

Cited In (6)

• An Efficient Algorithm for the Nearly Equitable Edge Coloring Problem
• A flow based pruning scheme for enumerative equitable coloring algorithms
• Polynomial time complexity of edge colouring graphs with bounded colour classes
• Fast edge colorings with fixed number of colors to minimize imbalance
• Fast Edge Colorings with Fixed Number of Colors to Minimize Imbalance
• A fast algorithm for equitable coloring

This page was built for publication: A Fast Algorithm for Computing a Nearly Equitable Edge Coloring with Balanced Conditions

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