共 32 条
- [1] [Anonymous], ARXIV11120790
- [2] [Anonymous], 2002, Proceedings of the 34th annual ACM symposium on theory of computing, STOC' 02
- [3] [Anonymous], 1970, Soviet Math. Doklady
- [4] [Anonymous], 2012, P 23 ANN ACM SIAM S
- [5] [Anonymous], J ACM
- [6] Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs in Near-Linear Time [J]. 2011 IEEE 52ND ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS 2011), 2011, : 170 - 179
- [7] Cheriyan J, 1996, ALGORITHMICA, V15, P521, DOI 10.1007/BF01940880
- [8] Duan R., 2012, P 23 ANN ACM SIAM S, P1413, DOI DOI 10.1137/1.9781611973099.111
- [10] MAXIMUM MATCHING AND A POLYHEDRON WITH O'1-VERTICES [J]. JOURNAL OF RESEARCH OF THE NATIONAL BUREAU OF STANDARDS SECTION B-MATHEMATICS AND MATHEMATICAL, 1965, B 69 (1-2): : 125 - +