Bisecting a 4-connected graph with three resource sets

Discrete Applied Mathematics

Volumn 155, Issue 11, 2007, Pages 1441-1450

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

^a OTARU UNIVERSITY OF COMMERCE   (Japan)

^b MAZDA MOTOR CORPORATION   (Japan)

^c KYOTO UNIVERSITY   (Japan)

Author keywords

Embedding; Graph algorithm; Graph connectivity; Graph partition problem

Indexed keywords

NUMERICAL METHODS; PROBLEM SOLVING; SET THEORY;

GRAPH ALGORITHMS; GRAPH CONNECTIVITY; GRAPH PARTITION PROBLEMS; SUBGRAPH;

GRAPH THEORY;

EID: 34250157735     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2007.03.004     Document Type: Article

References (15)

1. Bozkaya B., Laporte G., and Erkut E. A tabu search heuristic and adaptive memory procedure for political districting. European J. Oper. Res. 144 (2003) 12-26
2. Chi-Yuan L., Matoušek J., and Steiger W. Algorithms for ham-sandwich cuts. Discrete Comput. Geom. 11 (1994) 433-452
3. Chleíková J. Approximating the maximally balanced connected partition problem in graphs. Inform. Process. Lett. 60 (1999) 225-230
4. Dyer M.E., and Frieze A.M. On the complexity of partitioning graphs into connected subgraphs. Discrete Appl. Math. 10 (1985) 139-153
5. Edelsbrunner H. Algorithms in Combinatorial Geometry (1987), Springer, Berlin
6. Gonzales R.C., and Wintz P. Digital Image Processing (1977), Addison-Wesley, Reading,MA
7. Hayes B. Machine politics. Amer. Sci. 84 (1996) 522-526
8. A. Kanevsky, R. Tamassia, G. Di Battista, J. Chen, On-line maintenance of the four-connected components of a graph, in: Proceedings of the 32th IEEE Symposium on Foundations of Computer Science, 1991, pp. 793-801.
9. Martinov N. A recursive characterization of the 4-connected graphs. Discrete Math. 84 (1990) 105-108
10. Nagamochi H., and Ibaraki T. A linear-time algorithm for finding a sparse k-connected spanning subgraph of a k-connected graph. Algorithmica 7 (1992) 583-596
11. Nagamochi H., Jordán T., Nakao Y., and Ibaraki T. Convex embeddings bisecting of 3-connected graphs. Combinatorica 22 4 (2002) 537-554
12. Suzuki H., Takahashi N., and Nishizeki T. A linear algorithm for bipartition of biconnected graphs. Inform. Process. Lett. 33 (1990) 227-232
13. Tsichritzis D.C., and Bernstein P.A. Operating Systems (1981), Academic Press, New York
14. K. Wada, K. Kawaguchi, Efficient algorithms for tripartitioning triconnected graphs and 3-edge-connected graphs, in: Lecture Notes in Computer Science, vol. 790, Springer, Graph-theoretic Concepts in Computer Science, 1994, pp. 132-143.
15. Williams Jr. J.C. Political redistricting: a review. Papers in Regional Science 74 (1995) 12-40