Permutation Graphs: Connected Domination and Steiner Trees

Charles Colbourn, Lorna K. Stewart

Research output: Contribution to journalArticle

4 Citations (Scopus)

Abstract

Efficient algorithms are developed for finding a minimum cardinality connected dominating set and a minimum cardinality Steiner tree in permutation graphs. This contrasts with the known NP-completeness of both problems on comparability graphs in general.

Original languageEnglish (US)
Pages (from-to)179-189
Number of pages11
JournalAnnals of Discrete Mathematics
Volume48
Issue numberC
DOIs
StatePublished - 1991
Externally publishedYes

Fingerprint

Permutation Graphs
Steiner Tree
Domination
Cardinality
Comparability Graph
Connected Dominating Set
NP-completeness
Efficient Algorithms

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics

Cite this

Permutation Graphs : Connected Domination and Steiner Trees. / Colbourn, Charles; Stewart, Lorna K.

In: Annals of Discrete Mathematics, Vol. 48, No. C, 1991, p. 179-189.

Research output: Contribution to journalArticle

@article{6163e3f795364f5ab128ee0a30870741,
title = "Permutation Graphs: Connected Domination and Steiner Trees",
abstract = "Efficient algorithms are developed for finding a minimum cardinality connected dominating set and a minimum cardinality Steiner tree in permutation graphs. This contrasts with the known NP-completeness of both problems on comparability graphs in general.",
author = "Charles Colbourn and Stewart, {Lorna K.}",
year = "1991",
doi = "10.1016/S0167-5060(08)71048-3",
language = "English (US)",
volume = "48",
pages = "179--189",
journal = "Annals of Discrete Mathematics",
issn = "0167-5060",
publisher = "Elsevier",
number = "C",

}

TY - JOUR

T1 - Permutation Graphs

T2 - Connected Domination and Steiner Trees

AU - Colbourn, Charles

AU - Stewart, Lorna K.

PY - 1991

Y1 - 1991

N2 - Efficient algorithms are developed for finding a minimum cardinality connected dominating set and a minimum cardinality Steiner tree in permutation graphs. This contrasts with the known NP-completeness of both problems on comparability graphs in general.

AB - Efficient algorithms are developed for finding a minimum cardinality connected dominating set and a minimum cardinality Steiner tree in permutation graphs. This contrasts with the known NP-completeness of both problems on comparability graphs in general.

UR - http://www.scopus.com/inward/record.url?scp=77957813269&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=77957813269&partnerID=8YFLogxK

U2 - 10.1016/S0167-5060(08)71048-3

DO - 10.1016/S0167-5060(08)71048-3

M3 - Article

AN - SCOPUS:77957813269

VL - 48

SP - 179

EP - 189

JO - Annals of Discrete Mathematics

JF - Annals of Discrete Mathematics

SN - 0167-5060

IS - C

ER -