An efficient algorithm for edge-coloring series parallel multigraphs

X. Zhou, S. Nakano, H. Suzuki, T. Nishizeki

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Citations (Scopus)

Abstract

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|Δ), where V is the set of vertices and Δ the maximum degree.

Original languageEnglish
Title of host publicationLATIN 1992 - 1st Latin American Symposium on Theoretical Informatics, Proceedings
EditorsImre Simon
PublisherSpringer-Verlag
Pages516-529
Number of pages14
ISBN (Print)9783540552840
DOIs
Publication statusPublished - 1992 Jan 1
Event1st International Symposium on Latin American Theoretical Informatics, LATIN 1992 - Sao Paulo, Brazil
Duration: 1992 Apr 61992 Apr 10

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume583 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other1st International Symposium on Latin American Theoretical Informatics, LATIN 1992
CountryBrazil
CitySao Paulo
Period92/4/692/4/10

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'An efficient algorithm for edge-coloring series parallel multigraphs'. Together they form a unique fingerprint.

Cite this