✦ LIBER ✦

Labelling algorithms for paired-domination problems in block and interval graphs

✍ Scribed by Lei Chen; Changhong Lu; Zhenbing Zeng

Publisher: Springer US
Year: 2008
Tongue: English
Weight: 368 KB
Volume: 19
Category: Article
ISSN: 1382-6905
DOI: 10.1007/s10878-008-9177-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Labeling algorithms for domination probl

Labeling algorithms for domination problems in sun-free chordal graphs

✍ Gerard J. Chang 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 921 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

Linear-Time Algorithm for the Paired-Dom

Linear-Time Algorithm for the Paired-Domination Problem in Convex Bipartite Graphs

✍ Ruo-Wei Hung 📂 Article 📅 2011 🏛 Springer 🌐 English ⚖ 809 KB

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

Improved Algorithms and Complexity Resul

Improved Algorithms and Complexity Results for Power Domination in Graphs

✍ Jiong Guo; Rolf Niedermeier; Daniel Raible 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 495 KB

Parallel Algorithms for Maximum Matching

Parallel Algorithms for Maximum Matching in Complements of Interval Graphs and Related Problems

✍ M. G. Andrews; M. J. Atallah; D. Z. Chen; D. T. Lee 📂 Article 📅 2000 🏛 Springer 🌐 English ⚖ 192 KB