Maintaining a large matching and a small vertex cover
暂无分享,去创建一个
[1] Mariano Zelke,et al. Weighted Matching in the Semi-Streaming Model , 2007, Algorithmica.
[2] Philip N. Klein,et al. A Fully Dynamic Approximation Scheme for Shortest Paths in Planar Graphs , 1998, Algorithmica.
[3] David Eppstein,et al. Dynamic graph algorithms , 2010 .
[4] Boaz Patt-Shamir,et al. Distributed approximate matching , 2007, PODC '07.
[5] Ronald L. Rivest,et al. Introduction to Algorithms, Second Edition , 2001 .
[6] Shimon Even,et al. An O (N2.5) algorithm for maximum matching in general graphs , 1975, 16th Annual Symposium on Foundations of Computer Science (sfcs 1975).
[7] Dana Ron,et al. On Approximating the Minimum Vertex Cover in Sublinear Time and the Connection to Distributed Algorithms , 2007, Electron. Colloquium Comput. Complex..
[8] David Eppstein,et al. Sparsification—a technique for speeding up dynamic graph algorithms , 1997, JACM.
[9] Ronald L. Rivest,et al. Introduction to Algorithms , 1990 .
[10] Piotr Sankowski,et al. Faster dynamic matchings and vertex connectivity , 2007, SODA '07.
[11] Errol L. Lloyd,et al. Fully Dynamic Maintenance of Vertex Cover , 1993, WG.
[12] Andrew McGregor,et al. Finding Graph Matchings in Data Streams , 2005, APPROX-RANDOM.
[13] Silvio Micali,et al. An O(v|v| c |E|) algoithm for finding maximum matching in general graphs , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).
[14] Leah Epstein,et al. Improved Approximation Guarantees for Weighted Matching in the Semi-streaming Model , 2009, SIAM J. Discret. Math..
[15] Clifford Stein,et al. Introduction to Algorithms, 2nd edition. , 2001 .
[16] Mikkel Thorup,et al. Fully-dynamic min-cut , 2001, STOC '01.
[17] Mikkel Thorup,et al. Worst-case update times for fully-dynamic all-pairs shortest paths , 2005, STOC '05.