A linear algorithm for finding a minimum dominating set in a cactus (Q1078205)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A linear algorithm for finding a minimum dominating set in a cactus |
scientific article; zbMATH DE number 3959480
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A linear algorithm for finding a minimum dominating set in a cactus |
scientific article; zbMATH DE number 3959480 |
Statements
A linear algorithm for finding a minimum dominating set in a cactus (English)
0 references
1986
0 references
A cactus is a graph in which each block is either an edge or a cycle. In this paper, a linear time algorithm for finding a minimum order dominating set in a cactus is presented.
0 references
cactus
0 references
linear time algorithm
0 references
minimum order dominating set
0 references
