Skip to main content
SpringerLink
Log in

Computing edge-connectivity in multiple and capacitated graphs

  • Conference paper
  • First Online:
Algorithms (SIGAL 1990)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 450))

Included in the following conference series:

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. C.Berge, Graphs and Hypergraphs, North-Holland, 1973.

    Google Scholar 

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

    Article  Google Scholar 

  3. M.L.Fredman and R.E.Tarjan, Fibonacci heaps and their uses in improved optimization algorithms, 25th Symp. Found. Compt. Sci. (1984), pp.338–346.

    Google Scholar 

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

    Article  Google Scholar 

  5. A.V.Goldberg and R.E.Tarjan, A new approach to the maximum flow problem, Proc. 18th ACM Symp. on the Theory of Comput., (1986), pp.136–146.

    Google Scholar 

  6. R.E. Gomory and T.C. Hu, Multi-terminal network flows, J. SIAM 9(4) (1961), pp.551–570.

    Google Scholar 

  7. D.W.Matula, Determining edge connectivity in O(nm), 28th IEEE Symp. Found. Compt. Sci. (1987), pp.249–251.

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

  10. C.P. Schnorr, Bottlenecks and edge connectivity in unsymmetrical networks, SIAM J.Computing 8 (1979), pp.265–274.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Applied Mathematics & Physics, Kyoto University, 606, Kyoto, Japan

    Hiroshi Nagamochi & Toshihide Ibaraki

Authors
  1. Hiroshi Nagamochi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Toshihide Ibaraki
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Tetsuo Asano Toshihide Ibaraki Hiroshi Imai Takao Nishizeki

Rights and permissions

Reprints and permissions

Copyright information

© 1990 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Nagamochi, H., Ibaraki, T. (1990). Computing edge-connectivity in multiple and capacitated graphs. In: Asano, T., Ibaraki, T., Imai, H., Nishizeki, T. (eds) Algorithms. SIGAL 1990. Lecture Notes in Computer Science, vol 450. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-52921-7_51

Download citation

  • DOI: https://doi.org/10.1007/3-540-52921-7_51

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-52921-7

  • Online ISBN: 978-3-540-47177-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation