✦ LIBER ✦

Labeling algorithms for domination problems in sun-free chordal graphs

✍ Scribed by Gerard J. Chang

Publisher: Elsevier Science
Year: 1988
Tongue: English
Weight: 921 KB
Volume: 22
Category: Article
ISSN: 0166-218X
DOI: 10.1016/0166-218x(88)90120-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Polynomial algorithms for the weighted p

Polynomial algorithms for the weighted perfect domination problems on chordal graphs and split graphs

✍ Maw-Shang Chang; Yi-Chang Liu 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 475 KB

Parallel algorithms for the domination p

Parallel algorithms for the domination problems in trapezoid graphs

✍ Y.Daniel Liang 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 608 KB

Trapezoid graphs are a superclass of permutation graphs and interval graphs. This paper presents first parallel algorithms for the independent domination, total domination, connected domination and domination problems in weighted trapezoid graphs. All these algorithms take O(log'n) time on a EREW PR