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 number A0579. Thanks are due to both referees for suggesting improvements in the presentation.
PY - 1991/1/1
Y1 - 1991/1/1
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
SN - 0167-5060
VL - 48
SP - 179
EP - 189
JO - Annals of Discrete Mathematics
JF - Annals of Discrete Mathematics
IS - C
ER -