✦ LIBER ✦

Linear algorithm for domatic number problem on interval graphs

✍ Scribed by A.Srinavasa Rao; C.Pandu Rangan

Book ID: 107765871
Publisher: Elsevier Science
Year: 1989
Tongue: English
Weight: 629 KB
Volume: 33
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(89)90184-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The Domatic Number Problem in Interval G

The Domatic Number Problem in Interval Graphs

✍ Lu, Tung-Lin; Ho, Pei-Hsin; Chang, Gerard J. 📂 Article 📅 1990 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 639 KB

Linear algorithm for optimal path cover

Linear algorithm for optimal path cover problem on interval graphs

✍ Srinivasa Rao Arikati; C. Pandu Rangan 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 412 KB

A simple linear time algorithm for the d

A simple linear time algorithm for the domatic partition problem on strongly chordal graphs

✍ Shen-Lung Peng; Maw-Shang Chang 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 355 KB

The domatic number problem on some perfe

The domatic number problem on some perfect graph families

✍ Haim Kaplan; Ron Shamir 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 543 KB

An optimal parallel algorithm for the do

An optimal parallel algorithm for the domatic partition problem on an interval graph given its sorted model

✍ Ming-Shing Yu; Cheng-Hsing Yang 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 646 KB

A linear-time algorithm for the weighted

A linear-time algorithm for the weighted feedback vertex problem on interval graphs

✍ Chin Lung Lu; Chuan Yi Tang 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 459 KB

We present a linear-time algorithm for finding a minimum weighted feedback vertex set on interval graphs using the dynamic programming technique. Since the weighted feedback vertex problem, the weighted C3.1 problem, the maximum weighted 2-colorable subgraph problem and the maximum weighted 2-indepe