论文信息 - On Edge Coloring Bipartite Graphs - 字舞流文

On Edge Coloring Bipartite Graphs

The present paper shows how to find a minimal edge coloring of a bipartite graph with E edges and V vertices in time $O(E\log V)$.

Richard Cole | John Hopcroft | J. Hopcroft | R. Cole

[1] Richard M. Karp,et al. A n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs , 1971, SWAT.

[2] Claude Berge,et al. Graphs and Hypergraphs , 2021, Clustering.