An Efficient Algorithm for Edge-Coloring Series-Parallel Multigraphs

@inproceedings{Zhou1992AnEA,
  title={An Efficient Algorithm for Edge-Coloring Series-Parallel Multigraphs},
  author={Xiao Zhou and Shin-Ichi Nakano and Hitoshi Suzuki and Takao Nishizeki},
  booktitle={LATIN},
  year={1992}
}
Many combinatorial problems can be efficiently solved for series-parallel graphs or partial k-trees. The edge-coloring problem is one of a few combinatorial problems for which no efficient algorithms have been obtained for series-parallel multigraphs. This paper gives an algorithm which optimally edge-colors a given series-parallel multigraph in time O([V[z~), where V is the set of vertices and A the maximum degree. 

From This Paper

Topics from this paper.
3 Citations
1 References
Similar Papers

Similar Papers

Loading similar papers…