Skip to main content

Graph augmentation problems for a specified set of vertices

  • Conference paper
  • First Online:

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

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. K. P. Eswaran and R. E. Tarjan, Augmentation problems, SIAM J. Comput., 5(1976), 653–655.

    Google Scholar 

  2. G. N. Frederickson and Ja'Ja', Approximation algorithms for several graph augmentation problems, SIAM J. Comput., 10(1981), 270–283.

    Google Scholar 

  3. F. Harary, "Graph Theory", Addison-Wesley, Reading, MA (1969)

    Google Scholar 

  4. A. Rosenthal and A. Goldner, Smallest augmentations to biconnect a Graph, SIAM J. Comput., 6(1977), 55–66.

    Google Scholar 

  5. T. Watanabe and A. Nakamura, Edge-connectivity augmentation problems, J. Comput. and System Sci., 35(1987-08), 96–144.

    Google Scholar 

  6. T. Watanabe and A. Nakamura, 3-connectivity augmentation problems, Proceedings of 1988 IEEE Int. Sympo. on Circuits and Systems(1988-6), 1847–1850.

    Google Scholar 

  7. T. Watanabe, T. Narita and A. Nakamura, 3-Edge-connectivity augmentation problems, 1989 IEEE Int. Sympo. on Circuits and Systems (1989-05), 335–338.

    Google Scholar 

  8. T. Watanabe and A. Nakamura, A Smallest augmentation to 3-connect a graph, Discrete Applied Mathematics, to appear.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

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

Watanabe, T., Higashi, Y., Nakamura, A. (1990). Graph augmentation problems for a specified set of vertices. 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_87

Download citation

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

  • 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