A nearly linear time algorithm for the half integral parity disjoint paths packing problem
暂无分享,去创建一个
[1] Bruce A. Reed,et al. An Improved Algorithm for Finding Tree Decompositions of Small Width , 1999, WG.
[2] Sanjeev Khanna,et al. Edge-disjoint paths in Planar graphs with constant congestion , 2006, STOC '06.
[3] A. Thomason. An extremal function for contractions of graphs , 1984, Mathematical Proceedings of the Cambridge Philosophical Society.
[4] Ken-ichi Kawarabayashi,et al. Algorithmic graph minor theory: Decomposition, approximation, and coloring , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).
[5] Bruce A. Reed,et al. A nearly linear time algorithm for the half integral disjoint paths packing , 2008, SODA '08.
[6] Paul Wollan,et al. Non-zero disjoint cycles in highly connected group labeled graphs , 2005, Electron. Notes Discret. Math..
[7] Ken-ichi Kawarabayashi,et al. Some remarks on the odd hadwiger’s conjecture , 2007, Comb..
[8] James F. Lynch,et al. The equivalence of theorem proving and the interconnection problem , 1975, SIGD.
[9] Bruce A. Reed,et al. Highly parity linked graphs , 2009, Comb..
[10] Bruce A. Reed,et al. Finding disjoint trees in planar graphs in linear time , 1991, Graph Structure Theory.
[11] Clifford Stein,et al. Improved approximation algorithms for unsplittable flow problems , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.
[12] Bruce A. Reed,et al. On the odd-minor variant of Hadwiger's conjecture , 2009, J. Comb. Theory, Ser. B.
[13] B. Reed. Surveys in Combinatorics, 1997: Tree Width and Tangles: A New Connectivity Measure and Some Applications , 1997 .
[14] John E. Hopcroft,et al. The Directed Subgraph Homeomorphism Problem , 1978, Theor. Comput. Sci..
[15] Neil Robertson,et al. Graph Minors .XIII. The Disjoint Paths Problem , 1995, J. Comb. Theory B.
[16] Stefan Arnborg,et al. Linear time algorithms for NP-hard problems restricted to partial k-trees , 1989, Discret. Appl. Math..
[17] Richard M. Karp,et al. On the Computational Complexity of Combinatorial Problems , 1975, Networks.
[18] R Bruce,et al. MANGOES AND BLUEBERRIES , 1999 .
[19] Carsten Thomassen,et al. Graphs on Surfaces , 2001, Johns Hopkins series in the mathematical sciences.
[20] Robert E. Tarjan,et al. Data structures and network algorithms , 1983, CBMS-NSF regional conference series in applied mathematics.
[21] Bruce A. Reed,et al. Finding approximate separators and computing tree width quickly , 1992, STOC '92.
[22] Paul D. Seymour,et al. Graph Minors: XV. Giant Steps , 1996, J. Comb. Theory, Ser. B.
[23] Paul D. Seymour,et al. Graph Minors. XVI. Excluding a non-planar graph , 2003, J. Comb. Theory, Ser. B.
[24] Laura Sheppardson,et al. DISJOINT PATHS IN PLANAR GRAPHS , 2003 .
[25] Paul D. Seymour,et al. Packing Non-Zero A-Paths In Group-Labelled Graphs , 2006, Comb..
[26] Ken-ichi Kawarabayashi,et al. Linear connectivity forces large complete bipartite minors: [J. Combin. Theory Ser. B Vol. 99(2)] , 2009, J. Comb. Theory, Ser. B.
[27] P. D. Seymour,et al. Matroid minors , 1996 .
[28] Bruce A. Reed,et al. Finding odd cycle transversals , 2004, Oper. Res. Lett..
[29] Éva Tardos,et al. Approximations for the disjoint paths problem in high-diameter planar networks , 1995, STOC '95.
[30] Ken-ichi Kawarabayashi,et al. Linear connectivity forces large complete bipartite minors , 2009, J. Comb. Theory, Ser. B.
[31] Alexandr V. Kostochka,et al. Lower bound of the hadwiger number of graphs by their average degree , 1984, Comb..
[32] J. Adrian Bondy,et al. OSA PROPERTY FOR LONG CIRCUITS , 2007 .
[33] Ken-ichi Kawarabayashi,et al. The Erdos-Pósa property for vertex- and edge-disjoint odd cycles in graphs on orientable surfaces , 2007, Discret. Math..
[34] Paul D. Seymour,et al. Graph minors. V. Excluding a planar graph , 1986, J. Comb. Theory B.
[35] Toshihide Ibaraki,et al. A linear-time algorithm for finding a sparsek-connected spanning subgraph of ak-connected graph , 1992, Algorithmica.
[36] MATTHIAS MIDDENDORF,et al. On the complexity of the disjoint paths problem , 1993, Comb..
[37] P. Erd Os,et al. On the maximal number of disjoint circuits of a graph , 2022, Publicationes Mathematicae Debrecen.
[38] Jon M. Kleinberg,et al. Decision algorithms for unsplittable flow and the half-disjoint paths problem , 1998, STOC '98.
[39] Robin Thomas,et al. Quickly Excluding a Planar Graph , 1994, J. Comb. Theory, Ser. B.
[40] Bruce A. Reed,et al. Rooted Routing in the Plane , 1993, Discret. Appl. Math..
[41] Bruce A. Reed,et al. Mangoes and Blueberries , 1999, Comb..
[42] Sanjeev Khanna,et al. Edge-disjoint paths in planar graphs , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.