Algorithms on block-complete graphs

  • Zhuguo Mo
  • Kenneth Williams
Track1: Graph Algorithms
Part of the Lecture Notes in Computer Science book series (LNCS, volume 507)


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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    G. Chartrand and L. Lesniak, Graphs and Digraphs, Second Edition, Wadsworth & Brooks/Cole, 1986.Google Scholar
  2. [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. [3]
    J. E. Hopcroft and R. E. Tarjan, Efficient algorithms for graph manipulation, Comm. ACM, 16 (1973) 372–378.CrossRefGoogle Scholar
  4. [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.zbMATHMathSciNetCrossRefGoogle Scholar
  5. [5]
    Z. Mo, Graph and Directed Graph Augmentation Problems, Doctoral Dissertation, Western Michigan University, 1988.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1991

Authors and Affiliations

  • Zhuguo Mo
    • 1
  • Kenneth Williams
    • 2
  1. 1.Computer & Engineering Services, Inc.USA
  2. 2.Western Michigan UniversityUSA

Personalised recommendations