A linear-time algorithm for finding a sparsek-connected spanning subgraph of ak-connected graph

Abstract

We show that anyk-connected graphG = (V, E) has a sparsek-connected spanning subgraphG′ = (V, E′) with ¦E′¦ =O(k¦V¦) by presenting anOE¦)-time algorithm to find one such subgraph, where connectivity stands for either edge-connectivity or node-connectivity. By using this algorithm as preprocessing, the time complexities of some graph problems related to connectivity can be improved. For example, the current best time boundO(max{k 2¦V¦1/2,k¦V¦}¦E¦) to determine whether node-connectivityK(G) of a graphG = (V, E) is larger than a given integerk or not can be reduced toO(max{k 3¦V¦3/2,k 2¦V¦2}).

This is a preview of subscription content, access via your institution.

References

  1. [1]

    S. Even and R. E. Tarjan, Network flow and testing graph connectivity,SIAM J. Comput. 4 (1975), 507–518.

    MATH  Article  MathSciNet  Google Scholar 

  2. [2]

    Z. Galil, Finding the vertex connectivity of graphs,SIAM J. Comput. 9 (1980), 197–199.

    MATH  Article  MathSciNet  Google Scholar 

  3. [3]

    M. R. Garey and D. S. Jhonson,Computer and Intractability, A Guide to the Theory of NP-completeness, Freeman, San Francisco, 1979.

    Google Scholar 

  4. [4]

    D. W. Matula, Determining edge connectivity inO(nm),Proceedings of the 28th Symposium on Foundations of Computer Science (1987), pp. 249–251.

  5. [5]

    H. Nagamochi and T. Ibaraki, Linear time algorithms for findingk-edge-connected andk-node-connected spanning subgraphs, Technical Report #89006, Department of Applied Mathematics and Physics, Faculty of Engineering, Kyoto University (1989).

  6. [6]

    H. Nagamochi and T. Ibaraki, Computing edge-connectivity in multiple and capacitated graphs, Technical Report # 89009, Department of Applied Mathematics and Physics, Faculty of Engineering, Kyoto University (1989).

  7. [7]

    H. Nagamochi, Z. Sun, and T. Ibaraki, Counting the number of minimum cuts in multiple undirected graphs, Technical Report #89010, Department of Applied Mathematics and Physics, Faculty of Engineering, Kyoto University (1989).

  8. [8]

    T. Nishizeki and S. Poljak, Highly connected factors with a small number of edges, Working Paper (1989).

  9. [9]

    H. Suzuki, N. Takahashi, and T. Nishizeki, An algorithm for finding a triconnected spanning subgraph, SIGAL Research Report 7-3 (in Japanese) (1989).

Download references

Author information

Affiliations

Authors

Additional information

The first author was partially supported by the Grant-in-Aid for Encouragement of Young Scientists of the Ministry of Education, Science and Culture of Japan and by the subvention to young scientists by the Research Foundation of Electrotechnology of Chubu.

Communicated by Greg N. Frederickson.

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Nagamochi, H., Ibaraki, T. A linear-time algorithm for finding a sparsek-connected spanning subgraph of ak-connected graph. Algorithmica 7, 583–596 (1992). https://doi.org/10.1007/BF01758778

Download citation

Key words

  • Undirected graphs
  • Spanning subgraphs
  • Connectivity
  • k-edge-connectivity
  • k-node-connectivity
  • Linear-time algorithms