Matching in Dynamic Graphs
暂无分享,去创建一个
[1] Sandeep Sen,et al. Maintaining Approximate Maximum Weighted Matching in Fully Dynamic Graphs , 2012, FSTTCS.
[2] Errol L. Lloyd,et al. Fully Dynamic Maintenance of Vertex Cover , 1993, WG.
[3] 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).
[4] Shay Solomon,et al. Simple deterministic algorithms for fully dynamic maximal matching , 2012, STOC '13.
[5] Richard Peng,et al. Fully Dynamic $(1+\epsilon)$-Approximate Matchings , 2013, 1304.0378.