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

DOI10.1007/978-3-642-02882-3_13zbMath1248.05206OpenAlexW1571291567MaRDI QIDQ5323056

Akiyoshi Shioura, Mutsunori Yagiura

Publication date: 23 July 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-02882-3_13

zbMATH Keywords

multigraphalgorithmbalanced conditionsnearly equitable edge coloring

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• A sufficient condition for equitable edge-colourings of simple graphs
• Improved Bounds on Nonblocking 3-Stage Clos Networks
• Edge Coloring and Decompositions of Weighted Graphs
• SCHEDULING FILE TRANSFERS UNDER PORT AND CHANNEL CONSTRAINTS
• Amalgamated Factorizations of Complete Graphs
• An Efficient Algorithm for the Nearly Equitable Edge Coloring Problem