Linear Algorithms for a k-partition Problem of Planar Graphs without Specifying Bases
This paper describes linear algorithms for partitioning a planar graph into k edge-disjoint connected subgraphs, each of which has a specified number of vertices and edges. If ℓ(≤ k) subgraphs contain the specified elements (called bases), we call this problem the k-partition problem with ℓ-base (denoted by k-PART-B(ℓ)). In this paper, we obtain the following results: (1)for any k ≥ 2, k-PART-B(1) can be solved in O(|E|) time for every 4-edge-connected planar graph G=(V,E), (2)3-PART-B(1) can be solved in O(|E|) time for every 2-edge-connected planar graph G=(V,E) and (3)5-PART-B(1) can be solved in O(|E|) time for every 3-edge-connected planar graph G=(V,E).
Unable to display preview. Download preview PDF.
- 3.Györi, E.: On division of connected subgraphs. In: Proc. 5th Hungarian Combinational Coll. Combinatorics 1976, Keszthely, pp. 485–494. North-Holland, Amsterdam (1978)Google Scholar
- 5.Jou, L., Suzuki, H., Nishizeki, T.: A linear algorithm for finding a nonseparat-ing ear decomposition of triconnected planar graphs.Tech. Rep. of Information Processing Society of Japan, AL40-3 (1994)Google Scholar
- 7.Lovász, L.: A homology theory for spanning trees of a graph. Acta math. Acad. Sci. Hunger 30, 241–251 (1977)Google Scholar
- 8.Nishizeki, T., Chiba, N.: Planar graphs: Theory and algorithms. Annals of Discrete Mathematics Monograph 32 (1988)Google Scholar
- 9.Wada, K., Chen, W.: Linear algorithms for a k-partition problem of planar graphs without specifying bases. Tech. Rep. of Wada-Lab. of ECE, NIT, TR98- 01 (1998)Google Scholar