Abstract
An algorithm for finding a minimal edge coloring of a bipartite multigraph is presented. The algorithm usesO(V 1/2 ElogV + V) time andO(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 2n, inO(E + V) time andO(E + V) space.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
A. V. Aho, J. E. Hopcroft, and J. D. Ullman,The Design and Analysis of Computer Algorithms (Addison-Wesley, Reading, Mass., 1974).
C. Berge,Graphs and Hypergraphs (North-Holland, Amsterdam, 1973).
M. A. H. Dempster, “Two Algorithms for the Time-Table Problem,” inCombinatorial 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 n5/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.
O. Ore,The Four Color Problem (Academic Press, New York, 1967).
Author information
Authors and Affiliations
Additional information
This work was partially supported by the National Science Foundation under Grant GJ36461.
Rights and permissions
About this article
Cite this article
Gabow, H.N. Using euler partitions to edge color bipartite multigraphs. International Journal of Computer and Information Sciences 5, 345–355 (1976). https://doi.org/10.1007/BF00998632
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF00998632