论文信息 - Efficient Implementation of Graph Algorithms Using Contraction

Efficient Implementation of Graph Algorithms Using Contraction

We define a graph problem which we refer to as the component merging problem. Versions of the problem appear as bottlenecks in various graph algorithms. We show how to solve an important special case of the problem.

[1] Jack Edmonds,et al. Maximum matching and a polyhedron with 0,1-vertices , 1965 .

[2] Richard M. Karp,et al. A simple derivation of Edmonds' algorithm for optimum branchings , 1971, Networks.

[3] Manuel Blum,et al. Time Bounds for Selection , 1973, J. Comput. Syst. Sci..

[4] Andrew Chi-Chih Yao,et al. An O(|E| log log |V|) Algorithm for Finding Minimum Spanning Trees , 1975, Inf. Process. Lett..

[5] Robert E. Tarjan,et al. Finding Minimum Spanning Trees , 1976, SIAM J. Comput..

[6] Robert E. Tarjan,et al. Finding optimum branchings , 1977, Networks.

[7] Francesco Maffioli,et al. A note on finding optimum branchings , 1979, Networks.

[8] Toshihide Ibaraki,et al. An Algorithm for Finding K Minimum Spanning Trees , 1981, SIAM J. Comput..

[9] S. Micali,et al. Priority queues with variable priority and an O(EV log V) algorithm for finding a maximal weighted matching in general graphs , 1982, FOCS 1982.

[10] Robert E. Tarjan,et al. Data structures and network algorithms , 1983, CBMS-NSF regional conference series in applied mathematics.

[11] Robert E. Tarjan,et al. Efficient Algorithms for a Family of Matroid Intersection Problems , 1984, J. Algorithms.