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

Discrete Applied Mathematics

Volumn 143, Issue 1-3, 2004, Pages 351-352

  Chang, Gerard J ^a  

^a NATIONAL TAIWAN UNIVERSITY   (Taiwan)

Author keywords

Chordal graph; Independent domination; NP complete; Weight

Indexed keywords

COMPUTATIONAL COMPLEXITY; FUNCTIONS; MATHEMATICAL MODELS; PROBLEM SOLVING; SET THEORY;

CHORDAL GRAPHS; INDEPENDENT DOMINATION;

GRAPH THEORY;

EID: 4243097005     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2003.05.004     Document Type: Article

References (5)

1. G.J. Chang, Algorithmic aspects of domination in graphs, in: D.-Z. Du, P.M. Pardalos (Eds.), Handbook of Combinatorial Optimization, Kluwer Academic Pub., Boston, Vol. 3, 1998, pp. 339-405.
2. Chang M.-S. Weighted domination of cocomparability graphs. Discrete Appl. Math. 80:1997;135-148.
3. Farber M. Independent domination in chordal graphs. Oper. Res. Lett. 1:1982;134-138.
4. Haynes T.W., Hedetniemi S.T., Slater P.J. Foundations of Domination in Graphs. The Theory:1998;Marcel Dekker, New York.
5. Haynes T.W., Hedetniemi S.T., Slater P.J. Domination in Graphs. Selected Topics:1998;Marcel Dekker, New York.