Algorithms on block-complete graphs
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.
- G. Chartrand and L. Lesniak, Graphs and Digraphs, Second Edition, Wadsworth & Brooks/Cole, 1986.Google Scholar
- 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
- Z. Mo, Graph and Directed Graph Augmentation Problems, Doctoral Dissertation, Western Michigan University, 1988.Google Scholar