Data structures for weighted matching and nearest common ancestors with linking

This paper shows that the weighted matching problem on general graphs can be solved in time O(n(m + n log n)), f or n and m the number of vertices and edges, respectively. This was previously known only for bipartite graphs. It also shows that a sequence of m nca and link operations on n nodes can be processed on-line in time O(ma(m, n)+n). This was previously known only for a restricted type of link operation.

[1]  H. W. Kuhn B R Y N Mawr College.  Variants of the Hungarian Method for Assignment Problems' , 1955 .

[2]  H. Kuhn.  The Hungarian method for the assignment problem , 1955 .

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

[4]  Harold Neil Gabow,et al.  Implementation of algorithms for maximum matching on nonbipartite graphs , 1973 .

[5]  W. Cunningham,et al.  A primal algorithm for optimum matching , 1978 .

[6]  Robert E. Tarjan,et al.  Applications of Path Compression on Balanced Trees , 1979, JACM.

[7]  G. M. Weber.  Sensitivity analysis of optimal matchings , 1981, Networks.

[8]  Robert E. Tarjan,et al.  A data structure for dynamic trees , 1981, STOC '81.

[9]  Silvio 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, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[10]  Robert E. Tarjan,et al.  Sensitivity Analysis of Minimum Spanning Trees and Shortest Path Trees , 1982, Inf. Process. Lett..

[11]  Silvio 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, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[12]  Ulrich Derigs,et al.  An analysis of alternative strategies for implementing matching algorithms , 1983, Networks.

[13]  Robert E. Tarjan,et al.  A linear-time algorithm for a special case of disjoint set union , 1983, J. Comput. Syst. Sci..

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

[15]  Lawrence R. Rabiner,et al.  Combinatorial optimization:Algorithms and complexity , 1984 .

[16]  Robert E. Tarjan,et al.  A quick method for finding shortest pairs of disjoint paths , 1984, Networks.

[17]  Bernard Chazelle.  Computing on a Free Tree via Complexity-Preserving Mappings , 1984, FOCS.

[18]  Robert E. Tarjan,et al.  Fast Algorithms for Finding Nearest Common Ancestors , 1984, SIAM J. Comput..

[19]  Zvi Galil,et al.  Efficient Implementation of Graph Algorithms Using Contraction , 1984, FOCS.

[20]  Robert E. Tarjan,et al.  Fibonacci heaps and their uses in improved network optimization algorithms , 1984, JACM.

[21]  Matthias F. Stallmann,et al.  Efficient Algorithms for Graphic Matroid Intersection and Parity (Extended Abstract) , 1985, ICALP.

[22]  Harold N. Gabow,et al.  A scaling algorithm for weighted matching on general graphs , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[23]  Dov Harel,et al.  A linear algorithm for finding dominators in flow graphs and related problems , 1985, STOC '85.

[24]  Robert E. Tarjan,et al.  An Efficient Parallel Biconnectivity Algorithm , 2011, SIAM J. Comput..

[25]  Harold N. Gabow.  Scaling Algorithms for Network Problems , 1985, J. Comput. Syst. Sci..

[26]  L. Lovász.  Matching Theory (North-Holland mathematics studies) , 1986 .

[27]  Robert E. Tarjan,et al.  Efficient algorithms for finding minimum spanning trees in undirected and directed graphs , 1986, Comb..

[28]  Harold N. Gabow,et al.  Forests, frames, and games: algorithms for matroid sums and applications , 1988, STOC '88.

[29]  Uzi Vishkin,et al.  On Finding Lowest Common Ancestors: Simplification and Parallelization , 1988, AWOC.

[30]  Ying Xu,et al.  Efficient algorithms for independent assignment on graphic and linear matroids , 1989, 30th Annual Symposium on Foundations of Computer Science.

[31]  Michael E. Saks,et al.  The cell probe complexity of dynamic data structures , 1989, STOC '89.

[32]  Kurt Mehlhorn,et al.  Faster algorithms for the shortest path problem , 1990, JACM.

[33]  Robert E. Tarjan,et al.  Faster scaling algorithms for general graph matching problems , 1991, JACM.