Using euler partitions to edge color bipartite multigraphs
Received: 15 October 1975 DOI:
Cite this article as: Gabow, H.N. International Journal of Computer and Information Sciences (1976) 5: 345. doi:10.1007/BF00998632 Abstract
An algorithm for finding a minimal edge coloring of a bipartite multigraph is presented. The algorithm uses
O(V 1/2 Elog V + V) time and O( E + V) space. It is based on a divide-and-conquer strategy, using euler partitions to divide the graph. A modification of the algorithm for matching is described. This algorithm finds a maximum matching of a regular bipartite graph with all degrees 2 n, in O( E + V) time and O( E + V) space. Key words Edge coloring euler partition matching divide-and-conquer multigraph regular bipartite graph
This work was partially supported by the National Science Foundation under Grant GJ36461.
A. V. Aho, J. E. Hopcroft, and J. D. Ullman,
The Design and Analysis of Computer Algorithms (Addison-Wesley, Reading, Mass., 1974).
Graphs and Hypergraphs (North-Holland, Amsterdam, 1973).
M. A. H. Dempster, “Two Algorithms for the Time-Table Problem,” in
Combinatorial Mathematics and Its Applications, D. J. A. Welsh, Ed. (Academic Press, London, 1969), pp. 63–85.
C. C. Gotlieb, “The Construction of Class-Teacher Time-Tables,”
Proc. IFIP Congress 62, Munich (North-Holland, Amsterdam, 1963), pp. 73–77.
J. E. Hopcroft and R. M. Karp, “An n
5/2 Algorithm for Maximum Matchings in Bipartite Graphs,” SIAM J. Comput.
2(4):225–231 (Dec. 1973).
E. L. Lawler,
Combinatorial Optimization Theory (Holt, Rinehart, and Winston), to be published.
The Four Color Problem (Academic Press, New York, 1967). Copyright information
© Plenum Publishing Corporation 1976