On minimum intersection of two minimum dominating sets of interval graphs (Q1377653)

From MaRDI portal
Revision as of 16:11, 31 January 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article
Language Label Description Also known as
English
On minimum intersection of two minimum dominating sets of interval graphs
scientific article

    Statements

    On minimum intersection of two minimum dominating sets of interval graphs (English)
    0 references
    0 references
    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
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    domination
    0 references
    interval graph
    0 references
    graph algorithm
    0 references
    intersection
    0 references