TY - JOUR
T1 - Permutation graphs
T2 - Connected domination and Steiner trees
AU - Colbourn, Charles J.
AU - Stewart, Lorna K.
N1 - Funding Information:
Research of the first author is supported by NSERC Canada under grant numberA 0579. Thanks are due to both refereesf or suggestingim provementsin the presentation.
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
SN - 0012-365X
VL - 86
SP - 179
EP - 189
JO - Discrete Mathematics
JF - Discrete Mathematics
IS - 1-3
ER -