Combinatorica

, Volume 21, Issue 1, pp 5–12

Edge-Coloring Bipartite Multigraphs in O(E logD) Time

  • Richard Cole
  • Kirstin Ost
  • Stefan Schirra
Original Paper

DOI: 10.1007/s004930170002

Cite this article as:
Cole, R., Ost, K. & Schirra, S. Combinatorica (2001) 21: 5. doi:10.1007/s004930170002
  • 321 Downloads

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 logD time. This result follows from an algorithm for finding a matching in a regular bipartite graph in O(E) time.

AMS Subject Classification (1991) Classes:  68W05, 68W40 

Copyright information

© János Bolyai Mathematical Society, 2001

Authors and Affiliations

  • Richard Cole
    • 1
  • Kirstin Ost
    • 2
  • Stefan Schirra
    • 3
  1. 1.Courant Institute of Mathematical Sciences, New York University; NY 10012-1185, USA; E-mail: cole@cs.nyu.eduUS
  2. 2.SAP Retail Solutions; 66386 St. Ingbert, Germany; E-mail: kirstin.ost@sap-ag.deDE
  3. 3.Max-Planck-Institut für Informatik; 66123 Saarbrücken, Germany; E-mail: stschirr@mpi-sb.mpg.deDE

Personalised recommendations