✦ LIBER ✦

Connected domination and Steiner set on weighted permutation graphs

✍ Scribed by K. Arvind; C. Pandu Regan

Publisher: Elsevier Science
Year: 1992
Tongue: English
Weight: 521 KB
Volume: 41
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(92)90183-v

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Permutation graphs: Connected domination

Permutation graphs: Connected domination and Steiner trees

✍ Charles J. Colbourn; Lorna K. Stewart 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 702 KB

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.

Steiner set and connected domination in

Steiner set and connected domination in trapezoid graphs

✍ Y.Daniel Liang 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 710 KB

Doubly chordal graphs, steiner trees, an

Doubly chordal graphs, steiner trees, and connected domination

✍ M. Moscarini 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 949 KB

Steiner trees, connected domination and

Steiner trees, connected domination and strongly chordal graphs

✍ Kevin White; Martin Farber; William Pulleyblank 📂 Article 📅 1985 🏛 John Wiley and Sons 🌐 English ⚖ 829 KB

Edge domination on bipartite permutation

Edge domination on bipartite permutation graphs and cotriangulated graphs

✍ Anand Srinivasan; K. Madhukar; P. Nagavamsi; C.Pandu Rangan; Maw-Shang Chang 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 638 KB

The Minimum Weight Dominating Set Proble

The Minimum Weight Dominating Set Problem for Permutation Graphs Is in NC

✍ C. Rhee; S.K. Dhall; S. Lakshmivarahan 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 334 KB