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

Gerard J. Chang

doi:10.1016/j.dam.2003.05.004

ScienceGate Book Chapters

JOURNAL ARTICLE

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

Gerard J. Chang

Year: 2003 Journal: Discrete Applied Mathematics Vol: 143 (1-3)Pages: 351-352 Publisher: Elsevier BV

DOI: 10.1016/j.dam.2003.05.004

Get Full-Text PDF Get Analytical Report

Keywords:

Combinatorics Mathematics Chordal graph Dominating set Vertex (graph theory) Maximal independent set Independent set Pairwise comparison Interval graph Graph Domination analysis Discrete mathematics 1-planar graph Statistics

Metrics

Cited By

0.00

FWCI (Field Weighted Citation Impact)

Refs

0.14

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Citation History

Topics

Advanced Graph Theory Research

Physical Sciences → Computer Science → Computational Theory and Mathematics

Complexity and Algorithms in Graphs

Physical Sciences → Computer Science → Computational Theory and Mathematics

Limits and Structures in Graph Theory

Physical Sciences → Mathematics → Discrete Mathematics and Combinatorics

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

Metrics

Citation History

Topics

Related Documents

Independent domination in chordal graphs

Domination, independent domination, and duality in strongly chordal graphs

The Weighted Independent Domination Problem in Series-Parallel Graphs

Complete minors, independent sets, and chordal graphs

Weighted independent perfect domination on cocomparability graphs