Implementation of O(nmlogn) weighted matchings in general graphs: the power of data structures
暂无分享,去创建一个
[1] Kurt Mehlhorn,et al. A Heuristic for Dijkstra's Algorithm with Many Targets and Its Use in Weighted Matching Algorithms , 2001, ESA.
[2] Kurt Mehlhorn,et al. Data structures and algorithms. Volume 1 : Sorting and searching , 1984 .
[3] Alfred V. Aho,et al. The Design and Analysis of Computer Algorithms , 1974 .
[4] Harold N. Gabow,et al. Data structures for weighted matching and nearest common ancestors with linking , 1990, SODA '90.
[5] William J. Cook,et al. Computing Minimum-Weight Perfect Matchings , 1999, INFORMS J. Comput..
[6] Kurt Mehlhorn,et al. The LEDA Platform of Combinatorial and Geometric Computing , 1997, ICALP.
[7] J. Edmonds. Paths, Trees, and Flowers , 1965, Canadian Journal of Mathematics.
[8] Jack Edmonds,et al. Maximum matching and a polyhedron with 0,1-vertices , 1965 .
[9] Kurt Mehlhorn,et al. Data Structures and Algorithms 3: Multi-dimensional Searching and Computational Geometry , 2012, EATCS Monographs on Theoretical Computer Science.
[10] 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).
[11] Harold Neil Gabow,et al. Implementation of algorithms for maximum matching on nonbipartite graphs , 1973 .
[12] William J. Cook,et al. Solving Large-Scale Matching Problems , 1991, Network Flows And Matching.
[13] Michael B. Dillencourt. Toughness and Delaunay triangulations , 1990, Discret. Comput. Geom..
[14] Kurt Mehlhorn,et al. Sorting and Searching (Eatcs Monographs on Theoretical Computer Science) , 1984 .
[15] Ulrich Derigs,et al. Solving (large scale) matching problems combinatorially , 1991, Math. Program..
[16] Kurt Mehlhorn,et al. LEDA: a platform for combinatorial and geometric computing , 1997, CACM.