Advertisement

Graph augmentation problems for a specified set of vertices

  • Toshimasa Watanabe
  • Yasuhiko Higashi
  • Akira Nakamura
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 450)

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    K. P. Eswaran and R. E. Tarjan, Augmentation problems, SIAM J. Comput., 5(1976), 653–655.Google Scholar
  2. [2]
    G. N. Frederickson and Ja'Ja', Approximation algorithms for several graph augmentation problems, SIAM J. Comput., 10(1981), 270–283.Google Scholar
  3. [3]
    F. Harary, "Graph Theory", Addison-Wesley, Reading, MA (1969)Google Scholar
  4. [4]
    A. Rosenthal and A. Goldner, Smallest augmentations to biconnect a Graph, SIAM J. Comput., 6(1977), 55–66.Google Scholar
  5. [5]
    T. Watanabe and A. Nakamura, Edge-connectivity augmentation problems, J. Comput. and System Sci., 35(1987-08), 96–144.Google Scholar
  6. [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. [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. [8]
    T. Watanabe and A. Nakamura, A Smallest augmentation to 3-connect a graph, Discrete Applied Mathematics, to appear.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1990

Authors and Affiliations

  • Toshimasa Watanabe
    • 1
  • Yasuhiko Higashi
    • 1
  • Akira Nakamura
    • 1
  1. 1.Faculty of EngineeringHiroshima UniversityHigashi-HiroshimaJapan

Personalised recommendations