Algorithms on block-complete graphs

descriptionPublicationkeyboard_double_arrow_right Part of book or chapter of book , Conference object , Other literature type 01 Jan 1991Publisher:Springer New York

Authors: Zhugou Mo; Kenneth Williams 0001;

doi: 10.1007/bfb0038470

Algorithms on block-complete graphs

- Summary
- Metrics

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.

Related Organizations

Eastern Michigan University
United States

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	1
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Average
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average

Found an issue? Give us feedback

1

Average

Upload OA version

Are you the author of this publication? Upload your Open Access version to Zenodo!

It’s fast and easy, just two clicks!

uploadUpload now