A plane graph representation of triconnected graphs

Given a graph G=(V,E), a set S={s"1,s"2,...,s"k} of k vertices of V, and k natural numbers n"1,n"2,...,n"k such that @?"i"="1^kn"i=|V|, the k-partition problem is to find a partition V"1,V"2,...,V"k of the vertex set V such that |V"i|=n"i, s"i@?V"i, and V"i induces a connected subgraph of G for each i=1,2,...,k. For the tripartition problem on a triconnected graph, a naive algorithm can be designed based on a directional embedding of G in the two-dimensional Euclidean space. However, for graphs of large number of vertices, the implementing of this algorithm requires high precision real arithmetic to distinguish two close vertices in the plane. In this paper, we propose an algorithm for dealing with the tripartition problem by introducing a new data structure called the region graph, which represents a kind of combinatorial embedding of the given graph in the plane. The algorithm constructs a desired tripartition combinatorially in the sense that it does not require any geometrical computation with actual coordinates in the Euclidean space.

[1]  W. T. Tutte Connectivity in graphs , 1966 .

[2]  S. N. Maheshwari,et al.  Finding Nonseparating Induced Cycles and Independent Spanning Trees in 3-Connected Graphs , 1988, J. Algorithms.

[3]  Petru Eles,et al.  System Level Hardware/Software Partitioning Based on Simulated Annealing and Tabu Search , 1997, Des. Autom. Embed. Syst..

[4]  Robert E. Tarjan,et al.  Dividing a Graph into Triconnected Components , 1973, SIAM J. Comput..

[5]  Martin E. Dyer,et al.  On the complexity of partitioning graphs into connected subgraphs , 1985, Discret. Appl. Math..

[6]  Ajit A. Diwan,et al.  Plane triangulations are 6-partitionable , 2002, Discret. Math..

[7]  Takao Nishizeki,et al.  A Linear Algorithm for Bipartition of Biconnected Graphs , 1990, Inf. Process. Lett..

[8]  M. Malik,et al.  Operating Systems , 1992, Lecture Notes in Computer Science.

[9]  Alon Itai,et al.  Three tree-paths , 1989, J. Graph Theory.

[10]  Paul Wintz,et al.  Instructor's manual for digital image processing , 1987 .

[11]  Justin C. Williams POLITICAL REDISTRICTING: A REVIEW , 2005 .

[12]  Yehoshua Perl,et al.  Most Uniform Path Partitioning and its Use in Image Processing , 1993, Discret. Appl. Math..

[13]  Petru Eles,et al.  VHDL system-level specification and partitioning in a hardware/software co-synthesis environment , 1994, Third International Workshop on Hardware/Software Codesign.

[14]  Gilbert Laporte,et al.  A tabu search heuristic and adaptive memory procedure for political districting , 2003, Eur. J. Oper. Res..

[15]  Hiroshi Nagamochi,et al.  A robust algorithm for bisecting a triconnected graph with two resource sets , 2005, Theor. Comput. Sci..

[16]  Makoto Imase,et al.  Fault-Tolerant Routings in a kappa-Connected Network , 1988, Inf. Process. Lett..

[17]  L. Lovász A homology theory for spanning tress of a graph , 1977 .

[18]  Shin-Ichi Nakano,et al.  A Linear-Time Algorithm for Four-Partitioning Four-Connected Planar Graphs , 1996, Inf. Process. Lett..

[19]  Alon Itai,et al.  The Multi-Tree Approach to Reliability in Distributed Networks , 1988, Inf. Comput..

[20]  Takine Tetsuya,et al.  Contention Free λ-planes in Optically Burst Switched WDM Networks , 2005 .

[21]  Fred S. Annexstein,et al.  Directional Routing via Generalized st-Numberings , 2000, SIAM J. Discret. Math..