Skip to main content
SpringerLink
Log in

Algorithms on block-complete graphs

  • Track1: Graph Algorithms
  • Conference paper
  • First Online:
Computing in the 90's (Great Lakes CS 1989)

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

Included in the following conference series:

Abstract

Graphs whose blocks are complete subgraphs are said to be block-complete graphs. Polynomial time algorithms to solve several problems, problems which are not believed to be polynomial for general graphs, are presented for connected block-complete graphs. These include: finding a minimum vertex cover, finding a minimum dominating set of radius r, and finding a minimum m-centrix radius r augmentation.

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.

Bibliography

  1. G. Chartrand and L. Lesniak, Graphs and Digraphs, Second Edition, Wadsworth & Brooks/Cole, 1986.

    Google Scholar 

  2. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman, San Francisco (1979).

    Google Scholar 

  3. J. E. Hopcroft and R. E. Tarjan, Efficient algorithms for graph manipulation, Comm. ACM, 16 (1973) 372–378.

    Article  Google Scholar 

  4. O. Kariv and S. L. Hakimi, An algorithmic approach to network location problems. I: The p-centers. SIAM J. Appl. Math. 37 (1979) 513–538.

    Article  MATH  MathSciNet  Google Scholar 

  5. Z. Mo, Graph and Directed Graph Augmentation Problems, Doctoral Dissertation, Western Michigan University, 1988.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer & Engineering Services, Inc., USA

    Zhuguo Mo

  2. Western Michigan University, USA

    Kenneth Williams

Authors
  1. Zhuguo Mo
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Kenneth Williams
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Naveed A. Sherwani Elise de Doncker John A. Kapenga

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Mo, Z., Williams, K. (1991). Algorithms on block-complete graphs. In: Sherwani, N.A., de Doncker, E., Kapenga, J.A. (eds) Computing in the 90's. Great Lakes CS 1989. Lecture Notes in Computer Science, vol 507. Springer, New York, NY. https://doi.org/10.1007/BFb0038470

Download citation

  • DOI: https://doi.org/10.1007/BFb0038470

  • Published:

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-0-387-97628-0

  • Online ISBN: 978-0-387-34815-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation