Counting and sampling minimum cuts in genus g graphs
暂无分享,去创建一个
[1] O. Borůvka. On Minimum Spanning Trees , 1998 .
[2] David R. Karger. A Randomized Fully Polynomial Time Approximation Scheme for the All-Terminal Network Reliability Problem , 1999, SIAM J. Comput..
[3] David Eppstein,et al. Flows in One-Crossing-Minor-Free Graphs , 2010, ISAAC.
[4] Ivona Bezáková,et al. Counting and sampling minimum (s, t)-cuts in weighted planar graphs in polynomial time , 2012, Theor. Comput. Sci..
[5] Danupon Nanongkai,et al. A deterministic near-linear time algorithm for finding minimum cuts in planar graphs , 2004, SODA '04.
[6] Bojan Mohar,et al. Finding Shortest Non-Separating and Non-Contractible Cycles for Topologically Embedded Graphs , 2007, Discret. Comput. Geom..
[7] Herbert Edelsbrunner,et al. Computational Topology - an Introduction , 2009 .
[8] Glencora Borradaile,et al. Polynomial-Time Approximation Schemes for Subset-Connectivity Problems in Bounded-Genus Graphs , 2012, Algorithmica.
[9] R. Ho. Algebraic Topology , 2022 .
[10] Karsten Weihe. Maximum (s,t)-flows in planar networks in O(|V|log|V|) time , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.
[11] Charles J. Colbourn. Combinatorial aspects of network reliability , 1991, Ann. Oper. Res..
[12] Amir Nayyeri,et al. Computing replacement paths in surface embedded graphs , 2011, SODA '11.
[13] Leslie G. Valiant,et al. Random Generation of Combinatorial Structures from a Uniform Distribution , 1986, Theor. Comput. Sci..
[14] Mark Jerrum,et al. Random Generation of Combinatorial Structures from a Uniform Distribution (Extended Abstract) , 1985, ICALP.
[15] Carsten Thomassen,et al. Graphs on Surfaces , 2001, Johns Hopkins series in the mathematical sciences.
[16] Philip N. Klein,et al. Steiner Tree in Planar Graphs: An O ( n log n ) Approximation Scheme with Singly-Exponential Dependence on Epsilon , 2007, WADS.
[17] David Eppstein. Diameter and Treewidth in Minor-Closed Graph Families , 2000, Algorithmica.
[18] Matthias Müller-Hannemann,et al. Shortest paths in linear time on minor-closed graph classes, with an application to Steiner tree approximation , 2009, Discret. Appl. Math..
[19] Gary L. Miller,et al. Isomorphism testing for graphs of bounded genus , 1980, STOC '80.
[20] John H. Reif,et al. Minimum s-t Cut of a Planar Undirected Network in O(n log2(n)) Time , 1983, SIAM J. Comput..
[21] Erin W. Chambers,et al. Multiple source shortest paths in a genus g graph , 2007, SODA '07.
[22] Piotr Sankowski,et al. Min-Cuts and Shortest Cycles in Planar Graphs in O(n loglogn) Time , 2011, ESA.
[23] Martin Kutz,et al. Computing shortest non-trivial cycles on orientable surfaces of bounded genus in almost linear time , 2005, SCG '06.
[24] J. Scott Provan,et al. The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected , 1983, SIAM J. Comput..
[25] Martin Grohe,et al. Isomorphism testing for embeddable graphs through definability , 2000, STOC '00.
[26] David Eppstein,et al. Dynamic generators of topologically embedded graphs , 2002, SODA '03.
[27] J. Scott Provan,et al. Calculating bounds on reachability and connectedness in stochastic networks , 1983, Networks.
[28] Alon Itai,et al. Maximum Flow in Planar Networks , 1979, SIAM J. Comput..
[29] Bruce A. Reed,et al. A Simpler Linear Time Algorithm for Embedding Graphs into an Arbitrary Surface and the Genus of Graphs of Bounded Tree-Width , 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.
[31] Martin Mareš. Two linear time algorithms for MST on minor closed graph classes , 2002 .
[32] Ariel Shamir,et al. A survey on Mesh Segmentation Techniques , 2008, Comput. Graph. Forum.
[33] Refael Hassin,et al. An O(n log2 n) Algorithm for Maximum Flow in Undirected Planar Networks , 1985, SIAM J. Comput..
[34] Toshihide Ibaraki,et al. Counting the number of minimum cuts in undirected multigraphs , 1991 .
[35] Greg N. Frederickson,et al. Fast Algorithms for Shortest Paths in Planar Graphs, with Applications , 1987, SIAM J. Comput..
[36] Philip N. Klein,et al. Shortest paths in directed planar graphs with negative lengths: A linear-space O(n log2 n)-time algorithm , 2010, TALG.
[37] Afra J. Zomorodian,et al. Topology for Computing (Cambridge Monographs on Applied and Computational Mathematics) , 2005 .
[38] Philip N. Klein,et al. A polynomial-time approximation scheme for Steiner tree in planar graphs , 2007, SODA '07.
[39] David R. Karger,et al. A randomized fully polynomial time approximation scheme for the all terminal network reliability problem , 1995, STOC '95.
[40] Olga Veksler,et al. Graph Cuts in Vision and Graphics: Theories and Applications , 2006, Handbook of Mathematical Models in Computer Vision.
[41] Kyle Fox. Shortest Non-trivial Cycles in Directed and Undirected Surface Graphs , 2013, SODA.
[42] Erin W. Chambers,et al. Minimum cuts and shortest homologous cycles , 2009, SCG '09.
[43] Erin W. Chambers,et al. Splitting (complicated) surfaces is hard , 2006, SCG '06.
[44] D. Rose,et al. Generalized nested dissection , 1977 .
[45] Philip N. Klein,et al. Multiple-source shortest paths in planar graphs , 2005, SODA '05.
[46] Amir Nayyeri,et al. Minimum cuts and shortest non-separating cycles via homology covers , 2011, SODA '11.
[47] Erin W. Chambers,et al. Homology flows, cohomology cuts , 2009, STOC '09.
[48] D. R. Fulkerson,et al. Maximal Flow Through a Network , 1956 .
[49] Stefan Friedrich,et al. Topology , 2019, Arch. Formal Proofs.
[50] Christian Wulff-Nilsen,et al. Solving the replacement paths problem for planar directed graphs in O(n log n) time , 2010, SODA '10.
[51] K. Weihe. Maximum (s,t)-Flows in Planar Networks in O( , 1997 .
[52] Viresh Patel,et al. Determining Edge Expansion and Other Connectivity Measures of Graphs of Bounded Genus , 2010, SIAM J. Comput..
[53] Piotr Sankowski,et al. Improved algorithms for min cut and max flow in undirected planar graphs , 2011, STOC '11.
[54] David Eppstein,et al. The Polyhedral Approach to the Maximum Planar Subgraph Problem: New Chances for Related Problems , 1994, GD.
[55] Glencora Borradaile,et al. Polynomial-Time Approximation Schemes for Subset-Connectivity Problems in Bounded-Genus Graphs , 2009, STACS.
[56] Christian Wulff-Nilsen,et al. Shortest Paths in Planar Graphs with Real Lengths in O(nlog2n/loglogn) Time , 2009, ESA.
[57] James B. Orlin,et al. Max flows in O(nm) time, or better , 2013, STOC '13.
[58] Erik D. Demaine,et al. Approximation algorithms via contraction decomposition , 2007, SODA '07.
[59] Philip N. Klein,et al. Faster Shortest-Path Algorithms for Planar Graphs , 1997, J. Comput. Syst. Sci..
[60] Arthur T. White. Orientable imbeddings of Cayley graphs , 1974 .
[61] Naomi Nishimura,et al. Characterizing Multiterminal Flow Networks and Computing Flows in Networks of Small Treewidth , 1998, J. Comput. Syst. Sci..
[62] John E. Hopcroft,et al. Linear time algorithm for isomorphism of planar graphs (Preliminary Report) , 1974, STOC '74.
[63] Philip N. Klein,et al. An O (n log n) algorithm for maximum st-flow in a directed planar graph , 2006, SODA '06.