A fast algorithm for computing a nearly equitable edge coloring with balanced conditions

DOI10.7155/JGAA.00213MaRDI QIDQ3075615zbMATHOpenAlexFDO

Authors Akiyoshi Shioura, Mutsunori Yagiura

Publication date 16 February 2011

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 https://doi.org/10.7155/jgaa.00213

Mathematics Subject Classification ID

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

Recommendations

• A Fast Algorithm for Computing a Nearly Equitable Edge Coloring with Balanced Conditions
• An Efficient Algorithm for the Nearly Equitable Edge Coloring Problem
• New Bounds for the Nearly Equitable Edge Coloring Problem
• On equitable edge-coloring of multigraphs
• A fast algorithm for equitable coloring

Cited in

(8)

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

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)