Efficient algorithms for a mixed k-partition problem of graphs without specifying bases

  • Koichi Wada
  • Akinari Takaki
  • Kimio Kawaguchi
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 903)


This paper describes efficient algorithms for partitioning a k-edge-connected graph into k edge-disjoint connected subgraphs, each of which has a specified number of elements(vertices and edges). If each subgraph contains the specified element (called base), we call this problem the mixed k-partition problem with bases(called k-PART-WB), otherwise we call it the mixed k-partition problem without bases (called k-PART-WOB). In this paper, we show that k-PART-WB always has a solution for every k-edge-connected graph and we consider the problem without bases and we obtain the following results: (1)for any k≥2, k-PART-WOB can be solved in O(∥V∥√∥V∥log2V∥+∥E∥) time for every 4-edge-connected graph G=(V,E), (2)3-PART-WOB can be solved in O(∥V2) for every 2-edge-connected graph G=(V,E) and (3)4-PART-WOB can be solved in O(∥E2) for every 3-edge-connected graph G=(V,E).


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    B. Bollobás: Extremal graph theory, Academic Press, 11–13 (1978).Google Scholar
  2. 2.
    J. Cherian and S.N. Maheshwari: “Finding nonseparating induced cycles and independent spanning trees in 3-connected graphs,” Journal of Algorithms, 9, 507–537 (1988).Google Scholar
  3. 3.
    S. Even: Graph algorithms, Computer Science Press, Potomac, MD (1979).Google Scholar
  4. 4.
    H.N. Gabow and H.H. Westermann: “Forests frames and games: algorithms for matroid sums and applications,” Algorithmica, 7, 5/6, 465–497 (1992).Google Scholar
  5. 5.
    Z. Galil and G.F. Italiano: “Reducing edge connectivity to vertex connectivity,” SIGACT NEWS, 22, 1, 57–61 (1991).Google Scholar
  6. 6.
    E. Györi: “On division of connected subgraphs,” in: Combinatorics(Proc. 5th Hungarian Combinational Coll., 1976, Keszthely) North-Holland, Amsterdam, 485–494 (1978).Google Scholar
  7. 7.
    X. Han, P. Kelsen, V.Rämachandran and R. Tarjan: “Computing minimal spanning subgraphs in linear time,” Proc. of 3rd SODA, 146–156 (1992).Google Scholar
  8. 8.
    M. Imase and Y. Manabe: “Fault tolerant routings in a k-connected network,” Information Processing Letters, 28, 4, 171–175 (1988).Google Scholar
  9. 9.
    M. Junger, G. Reinelt and W.R. Pulleyblank: “On the partitioning the edges of graphs into connected subgraphs,” J. of Graph Theory, 9, 539–549 (1985).Google Scholar
  10. 10.
    L. Lovász: “A homology theory for spanning trees of a graph,” Acta math. Acad. Sci. Hunger, 30, 241–251 (1977).Google Scholar
  11. 11.
    H. Nagamochi and T. Ibaraki: “A linear-time algorithm for finding a sparse k-connected spanning subgraph of a k-connected graph,” Algorithmica, 7, 5/6, 583–596 (1992).Google Scholar
  12. 12.
    H. Suzuki, N. Takahashi and T. Nishizeki: “A linear algorithm for bipartition of biconnected graphs,” Information Processing Letters, 33, 5 (1990).Google Scholar
  13. 13.
    K. Wada, T. Shibuya, E. Shamoto and K. Kawaguchi: “A linear time (L, k)-edge-partition algorithm for connected graphs and fault-tolerant routings for k-edge-connected graphs,” Trans, of IEICE, J75-D-I, 11, 993–1004 (1992).Google Scholar
  14. 14.
    K. Wada, K. Kawaguchi and N. Yokoyama: “On a generalized k-partition problem for graphs,” Proc. of the 6th Karuizawa Workshop on Circuit and Systems, 243–248 (1993).Google Scholar
  15. 15.
    K. Wada and K. Kawaguchi: “Efficient algorithms for triconnected graphs and 3-edge-connected graphs,” Proc. of the 19th International Workshop on Graph-Theoretic Concepts in Computer Science(WG'93), Lecture Notes in Computer Science, 790, 132–143 (1994).Google Scholar
  16. 16.
    K. Wada, A. Takaki and K. Kawaguchi: “Efficient Algorithms for a Mixed k-partition Problem of Graphs without Specifying Bases,” Kawaguchi Lab. Technical Report of ECE in Nagoya Institute of Technology, TR-01-94(1994).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1995

Authors and Affiliations

  • Koichi Wada
    • 1
  • Akinari Takaki
    • 1
  • Kimio Kawaguchi
    • 1
  1. 1.Nagoya Institute of TechnologyNagoyaJapan

Personalised recommendations