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)$.
[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.