An Efficient Algorithm for the Nearly Equitable Edge Coloring Problem

DOI10.7155/jgaa.00171zbMath1161.68702OpenAlexW1972291244MaRDI QIDQ5301444

Xuzhen Xie, Uri Zwick, Takao Ono, Tomio Hirata, Mutsunori Yagiura

Publication date: 19 January 2009

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

Full work available at URL: http://www.emis.de/journals/JGAA/accepted/2008/Xie+2008.12.4.pdf

zbMATH Keywords

recursive algorithm

Mathematics Subject Classification ID

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

Related Items (1)

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

This page was built for publication: An Efficient Algorithm for the Nearly Equitable Edge Coloring Problem