𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The weighted independent domination problem is NP-complete for chordal graphs

✍ Scribed by Gerard J. Chang

Book ID
108110471
Publisher
Elsevier Science
Year
2004
Tongue
English
Weight
157 KB
Volume
143
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

The graph sandwich problem for 1-join co
The graph sandwich problem for 1-join composition is NP-complete
✍ Celina M.H. de Figueiredo; Sulamita Klein; Kristina VuΕ‘koviΔ‡ πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 280 KB

A graph is a 1-join composition if its vertex set can be partitioned into four nonempty sets \(A_{L}, A_{R}, S_{L}\) and \(S_{R}\) such that: every vertex of \(A_{L}\) is adjacent to every vertex of \(A_{R} ;\) no vertex of \(S_{L}\) is adjacent to a vertex of \(A_{R} \cup S_{R} ;\) no vertex of \(S