, Volume 21, Issue 1, pp 5-12

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

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access

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.

Received September 23, 1999