Author:
Chambers Erin W.,Fox Kyle,Nayyeri Amir
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Geometry and Topology,Theoretical Computer Science
Reference61 articles.
1. Ball, M.O., Provan, S.J.: Calculating bounds on reachability and connectedness in stochastic networks. Networks 13, 253–278 (1983)
2. Bezáková, I., Friedlander, A.J.: Counting and sampling minimum $$(s, t)$$ ( s , t ) -cuts in weighted planar graphs in polynomial time. Theoret. Comput. Sci. 417, 2–11 (2012)
3. Borradaile, G., Klein, P.: An $$O(n\log n)$$ O ( n log n ) algorithm for maximum $$st$$ s t -flow in a directed planar graph. J. ACM 56(2), 1–30 (2000)
4. Borradaile, G., Klein, P.: An $$O(n \log n)$$ O ( n log n ) -time algorithm for maximum $$st$$ s t -flow in a directed planar graph. In: Proceedings of 17th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 524–533 (2006)
5. Borradaile, G., Kenyon-Mathieu, C., Klein, P.N.: A polynomial-time approximation scheme for Steiner tree in planar graphs. In: Proceedings of 18th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1285–1294 (2007)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Holiest minimum-cost paths and flows in surface graphs;Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing;2018-06-20