Permutation graphs: Connected domination and Steiner trees

Charles Colbourn, Lorna K. Stewart

Research output: Contribution to journalArticle

34 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
JournalDiscrete Mathematics
Volume86
Issue number1-3
DOIs
StatePublished - Dec 14 1990
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
  • Theoretical Computer Science

Cite this

Permutation graphs : Connected domination and Steiner trees. / Colbourn, Charles; Stewart, Lorna K.

In: Discrete Mathematics, Vol. 86, No. 1-3, 14.12.1990, p. 179-189.

Research output: Contribution to journalArticle

Colbourn, Charles ; Stewart, Lorna K. / Permutation graphs : Connected domination and Steiner trees. In: Discrete Mathematics. 1990 ; Vol. 86, No. 1-3. pp. 179-189.
@article{79d411ee969545c0bc312740a7188785,
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 = "1990",
month = "12",
day = "14",
doi = "10.1016/0012-365X(90)90359-P",
language = "English (US)",
volume = "86",
pages = "179--189",
journal = "Discrete Mathematics",
issn = "0012-365X",
publisher = "Elsevier",
number = "1-3",

}

TY - JOUR

T1 - Permutation graphs

T2 - Connected domination and Steiner trees

AU - Colbourn, Charles

AU - Stewart, Lorna K.

PY - 1990/12/14

Y1 - 1990/12/14

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=38249017556&partnerID=8YFLogxK

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

U2 - 10.1016/0012-365X(90)90359-P

DO - 10.1016/0012-365X(90)90359-P

M3 - Article

AN - SCOPUS:38249017556

VL - 86

SP - 179

EP - 189

JO - Discrete Mathematics

JF - Discrete Mathematics

SN - 0012-365X

IS - 1-3

ER -