Skip to main content
SpringerLink
Log in
Book cover

Workshop on Algorithms and Data Structures

WADS 1989: Algorithms and Data Structures pp 563–576Cite as

Augmentation problems on hierarchically defined graphs

Preliminary version

  • Conference paper
  • First Online:

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

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. J. L. Bentley, T. Ottmann and P. Widmayer, The Complexity of Manipulating Hierarchically Defined Sets of Rectangles, Advances in Computing Research, Vol. 1, pp. 127–158, 1983.

    Google Scholar 

  2. K. P. Eswaran and R. E. Tarjan, Augmentation Problems, SIAM Journal on Computing, Vol. 5, No. 5, pp. 653–665, December 1976.

    Article  Google Scholar 

  3. H. Galperin and A. Widgerson. Succinct Representations of Graphs, Information and Control No. 56 (1983), 143–157.

    Google Scholar 

  4. T. Lengauer. Efficient algorithms for finding minimum spanning forests of hierarchically defined graphs. Journal of Algorithms No. 8 (1987), 260–284.

    Google Scholar 

  5. T. Lengauer and K. Wagner. The correlation between the complexities of the non-hierarchical and hierarchical versions of graph properties. Proceedings of STACS 87 (F.J. Brandenburg et al. eds.), Springer LNCS No. 247 (1987), 100–113.

    Google Scholar 

  6. T. Lengauer and E. Wanke. Efficient solution of connectivity problems on hierarchically defined graphs. SIAM J. Comput Vol. 17, No. 6, pp. 1063–1080, (1989).

    Google Scholar 

  7. T. Lengauer and E. Wanke. Decision Problems on Cellular Graph Grammars, Theoretische Informatik No. 45, University of Paderborn, Paderborn, West Germany, October 1987.

    Google Scholar 

  8. T. Lengauer and E. Wanke. Efficient processing of hierarchical graphs for engineering design. EATCS Bulletin, No 35 (1988).

    Google Scholar 

  9. J. B. Orlin. Some problems on dynamic/periodic graphs. Progress in Combinatorial Optimization, 1984.

    Google Scholar 

  10. C. Papadimitriou and M. Yannakakis. A note on succinct representation of graphs. Information and Control 71 (1986), 181–185.

    Article  Google Scholar 

  11. A. Rosenthal and Anita Goldner. Smallest Augmentations to Biconnect a Graph, SIAM Journal on Computing, Vol. 6, No. 1, pp. 55–66, March 1977.

    Article  Google Scholar 

  12. K. Wagner. The complexity of problems concerning graphs with regularities. Proceedings of MFCS 84 (M.P Chytil and V. Koubek, eds.), Springer LNCS No. 176 (1984), 544–552.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Iowa State University, 50011, Ames, Iowa

    David Fernández-Baca & Mark A. Williams

Authors
  1. David Fernández-Baca
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mark A. Williams
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

F. Dehne J. -R. Sack N. Santoro

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Fernández-Baca, D., Williams, M.A. (1989). Augmentation problems on hierarchically defined graphs. In: Dehne, F., Sack, J.R., Santoro, N. (eds) Algorithms and Data Structures. WADS 1989. Lecture Notes in Computer Science, vol 382. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51542-9_47

Download citation

  • DOI: https://doi.org/10.1007/3-540-51542-9_47

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-51542-5

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation