Skip to main content
SpringerLink
Log in

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

  • Original Paper
  • Published:
Combinatorica Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. Courant Institute of Mathematical Sciences, New York University; NY 10012-1185, USA; E-mail: cole@cs.nyu.edu, , , , , , US

    Richard Cole

  2. SAP Retail Solutions; 66386 St. Ingbert, Germany; E-mail: kirstin.ost@sap-ag.de, , , , , , DE

    Kirstin Ost

  3. Max-Planck-Institut für Informatik; 66123 Saarbrücken, Germany; E-mail: stschirr@mpi-sb.mpg.de, , , , , , DE

    Stefan Schirra

Authors
  1. Richard Cole
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Kirstin Ost
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Stefan Schirra
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Received September 23, 1999

Rights and permissions

Reprints and permissions

About this article

Cite this article

Cole, R., Ost, K. & Schirra, S. Edge-Coloring Bipartite Multigraphs in O(E logD) Time. Combinatorica 21, 5–12 (2001). https://doi.org/10.1007/s004930170002

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s004930170002

Search

Navigation