Skip to main content
SpringerLink
Log in

AnO(k 2n2) algorithm to find ak-partition in ak-connected graph

  • Published:
Journal of Computer Science and Technology Aims and scope Submit manuscript

Abstract

Although there are polynomial algorithms of finding a 2-partition or a 3-partition for a simple undirected 2-connected or 3-connected graph respectively, there is no general algorithm of finding ak-partition for ak-connected graphG=(V, E), wherek is the vertex connectivity ofG. In this paper, anO(k 2n2) general algorithm of finding ak-partition for ak-connected graph is proposed, wheren=|V|.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Manabe I. Building networks with some fixed routing and the ability to resist some obstacles. Electronic Information Communication Research Materials (in Japanese), COMP 86–70, 1987: 95–105.

    Google Scholar 

  2. Dyer M E, Frieze A M. On the complexity of partitioning graphs into connected subgraphs. Discrete Appl Math, 1985, 10: 139–153.

    Article  MATH  MathSciNet  Google Scholar 

  3. Gyôri E. On division of graph to connected subgraphs, combinatorics. In: Proc Fifth Hungarian Combinatorial Coll, Keszthely, Bolyai: North-Holland, 1978, 485–494.

    Google Scholar 

  4. Lovász L. A homology theory for spanning trees of a graph. Acta Math Acad, 1977, 30: 241–251.

    Article  Google Scholar 

  5. Hitoshi S, Naomi T, Takao N, Hiroshi M, Shuichi U. An algorithm for tripartitioning 3-connected graphs(in Japanese). J. of Information Processing, 1990, 30(5): 584–592.

    Google Scholar 

  6. Swamy N N S, Thulasiraman K. Graphs, networks and algorithms. John Wiley & Sons Inc, 1981, 143.

  7. Even S. The max flow algorithm of Dinic and Karzanov, an exposition. MIT/LCS/TM-80, 1976.

  8. Nagamochi H, Ibaraki T. A linear-time algorithm for finding a Sparsek-connected spanning subgraph of ak-connected graph. Algorithmica, 1992, 7: 583–596.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Shandong University, 250100, Jinan

    Jun Ma & Shaohan Ma

Authors
  1. Jun Ma
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Shaohan Ma
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

The research was supported by National Natural Science Foundation of China.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ma, J., Ma, S. AnO(k 2n2) algorithm to find ak-partition in ak-connected graph. J. of Compt. Sci. & Technol. 9, 86–91 (1994). https://doi.org/10.1007/BF02939489

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02939489

Keywords

Search

Navigation