On minimum intersection of two minimum dominating sets of interval graphs (Q1377653)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1109932
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On minimum intersection of two minimum dominating sets of interval graphs |
scientific article; zbMATH DE number 1109932 |
Statements
On minimum intersection of two minimum dominating sets of interval graphs (English)
0 references
26 March 1998
0 references
The paper gives linear time algorithms for finding two minimum (connected) dominating sets with minimum intersection for interval graphs. This problem was introduced by \textit{D. L. Grinstead} and \textit{P. J. Slater} [Discrete Math. 86, No. 1-3, 239-254 (1990; Zbl 0745.05057)].
0 references
domination
0 references
interval graph
0 references
graph algorithm
0 references
intersection
0 references
0 references
0.8635683655738831
0 references
0.8385047912597656
0 references
0.8350844979286194
0 references
0.8290411829948425
0 references
