Fault-tolerant routings in a &kgr;-connected network
Information Processing Letters
The multi-tree approach to reliability in distributed networks
Information and Computation
A linear algorithm for bipartition of biconnected graphs
Information Processing Letters
Most uniform path partitioning and its use in image processing
Discrete Applied Mathematics - Special issue: combinatorial structures and algorithms
A linear-time algorithm for four-partitioning four-connected planar graphs
Information Processing Letters
Directional Routing via Generalized st-Numberings
SIAM Journal on Discrete Mathematics
Plane triangulations are 6-partitionable
Discrete Mathematics
VHDL system-level specification and partitioning in a hardware/software co-synthesis environment
CODES '94 Proceedings of the 3rd international workshop on Hardware/software co-design
Operating systems
A robust algorithm for bisecting a triconnected graph with two resource sets
Theoretical Computer Science
| Hi-index | 5.23 |
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.