Edge-coloring bipartite multigraphs in O(E log D) time

Richard Cole, Kirstin Ost, Stefan Schirra

Research output: Contribution to journalArticle

Abstract

Let V, E, and D denote the cardinality of the vertex set, the cardinality of the edge set, and the maximum degree of a bipartite multigraph G. We show that a minimal edge-coloring of G can be computed in O(E log D) time. This result follows from an algorithm for finding a matching in a regular bipartite graph in O(E) time.

Original languageEnglish (US)
Pages (from-to)5-12
Number of pages8
JournalCombinatorica
Volume21
Issue number1
DOIs
Publication statusPublished - 2001

    Fingerprint

ASJC Scopus subject areas

  • Mathematics(all)
  • Discrete Mathematics and Combinatorics

Cite this