A robust algorithm for bisecting a triconnected graph with two resource sets

Theoretical Computer Science

Volumn 341, Issue 1-3, 2005, Pages 364-378

  Nagamochi, Hiroshi ^a   Iwata, Kengo ^b   Ishii, Toshimasa ^b  

^a KYOTO UNIVERSITY   (Japan)

^b TOYOHASHI UNIVERSITY OF TECHNOLOGY   (Japan)

Author keywords

3 Connected graphs; Bisections; Data structures; Graph embeddings; Ham sandwich cuts

Indexed keywords

COMPUTATION THEORY; COMPUTER SCIENCE; DATA STRUCTURES; EMBEDDED SYSTEMS; GEOMETRY; GRAPH THEORY; SET THEORY;

3-CONNECTED GRAPHS; BISECTIONS; GRAPH EMBEDDING; HAM-SANDWITCH CUTS;

ALGORITHMS;

EID: 23844468452     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2005.06.010     Document Type: Article

References (17)

1. B. Bozkaya, G. Laporte, and E. Erkut A tabu search heuristic and adaptive memory procedure for political districting European J. Oper. Res. 144 2003 12 26
2. L. Chi-Yuan, J. Matoušek, and W. Steiger Algorithms for ham-sandwich cuts Discrete Comput. Geom. 11 1994 433 452
3. M.E. Dyer, and A.M. Frieze On the complexity of partitioning graphs into connected subgraphs Discrete Appl. Math. 10 1985 139 153
4. H. Edelsbrunner Algorithms in Combinatorial Geometry 1987 Springer Berlin
5. R.C. Gonzales, and P. Wintz Digital Image Processing 1977 Addison-Wesley Reading, MA
6. B. Hayes Mach. Politics Amer. Scientist 84 1996 522 526
7. L. Lovász, K. Veszetergombi, Geometric representations of graphs, Paul Erdös and his Mathematics. II, Vol. 11, Bolyai Society Mathematical Studies, Budapest, 2002, pp. 471-498.
8. M. Lucertini, Y. Perl, and B. Simeone Most uniform path partitioning and its use in image processing Discrete Appl. Math. 42 1993 227 256
9. V.J. Milenkovic Verifiable implementations of geometric algorithms using finite precision arithmetic Artificial Intelligence 37 1988 377 401
10. H. Nagamochi, and T. Ibaraki A linear-time algorithm for finding a sparse k-connected spanning subgraph of a k-connected graph Algorithmica 7 1992 583 596
11. H. Nagamochi, T. Jordán, Y. Nakao, and T. Ibaraki Convex embeddings bisecting of 3-connected graphs Combinatorica 22 2002 537 554
12. T. Ottmann, G. Theimt, and C. Ullrich Numerical stability of geometric algorithms Proc. of the Third ACM Annual Symposium on Computational Geometry 1987 Waterloo Ontario 119 125
13. K. Sugihara, Robust geometric computation based on topological consistency, in: V.N. Alexandrov, et al. (Eds.), ICCS 2001, Lecture Notes in Computer Science, Vol. 2073, 2001, pp. 12-26.
14. K. Sugihara, and M. Iri Construction of the Voronoi diagram for "one million" generators in single-precision arithmetic Proc. IEEE 80 1992 1471 1484
15. D.C. Tsichritzis, and P.A. Bernstein Operating Systems 1981 Academic Press New York
16. W.T. Tutte Connectivity in Graphs 1966 University of Toronto Press Toronto, Ont.
17. J.C. Williams Jr. Political redistricting: a review Papers in Regional Science 74 1995 12 40