Algorithms for edge coloring bipartite graphs

Authors:
Harold N. Gabow;Oded Kariv
Affiliations:
-;-
Venue:
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Year:
1978

Citing 2
Cited 2

Open Shop Scheduling to Minimize Finish Time

Journal of the ACM (JACM)
Graphs and Hypergraphs

Graphs and Hypergraphs

Edge coloring planar graphs with two outerplanar subgraphs

SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Distributed edge coloration for bipartite networks

SSS'06 Proceedings of the 8th international conference on Stabilization, safety, and security of distributed systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

A minimum edge coloring of a bipartite graph is a partition of the edges into &Dgr; matchings, where &Dgr; is the maximum degree in the graph. Coloring algorithms are presented that use time O(min(¦E¦ &Dgr; log n, ¦E¦ @@@@n log n, n2log &Dgr;)) and space O(n&Dgr;). This compares favorably to the previous O(¦E¦ [equation] log &Dgr;) time bound. The coloring algorithms also find maximum matchings on regular (or semi-regular) bipartite graphs. The time bounds compare favorably to the O(¦E¦ @@@@n) matching algorithm, expect when [equation] ≤ &Dgr; ≤ @@@@n log n.