Bisecting Two Subsets in 3-Connected Graphs
暂无分享,去创建一个
Toshihide Ibaraki | Hiroshi Nagamochi | Tibor Jordán | Yoshitaka Nakao | T. Ibaraki | H. Nagamochi | Yoshitaka Nakao | T. Jordán
[1] W. T. Tutte. Connectivity in graphs , 1966 .
[2] Herbert Edelsbrunner,et al. Algorithms in Combinatorial Geometry , 1987, EATCS Monographs in Theoretical Computer Science.
[3] W. T. Tutte. Connectivity in Matroids , 1966, Canadian Journal of Mathematics.
[4] L. Lovász. A homology theory for spanning tress of a graph , 1977 .
[5] László Lovász,et al. Rubber bands, convex embeddings and graph connectivity , 1988, Comb..
[6] Herbert Edelsbrunner,et al. Computing a Ham-Sandwich Cut in Two Dimensions , 1986, J. Symb. Comput..
[7] David S. Johnson,et al. The Planar Hamiltonian Circuit Problem is NP-Complete , 1976, SIAM J. Comput..
[8] William L. Steiger,et al. Algorithms for ham-sandwich cuts , 1994, CCCG.
[9] Martin E. Dyer,et al. On the complexity of partitioning graphs into connected subgraphs , 1985, Discret. Appl. Math..
[10] Takao Nishizeki,et al. A Linear Algorithm for Bipartition of Biconnected Graphs , 1990, Inf. Process. Lett..
[11] Koichi Wada,et al. Efficient Algorithms for Tripartitioning Triconnected Graphs and 3-Edge-Connected Graphs , 1993, WG.