T. Karthick

activity

20152026

most citedWeighted Independent Sets in a Subclass of

P_{6}

-free Graphs

6 citations · 19 across the 13 of their papers we have counts for

collaborators

Showing 2015Show all

2 papers · 1 filter

cs.DM2015★ 6 cited

Weighted Independent Sets in a Subclass of $P_{6}$ -free Graphs

T. Karthick

The Maximum Weight Independent Set (MWIS) problem on graphs with vertex weights asks for a set of pairwise nonadjacent vertices of maximum total weight. The complexity of the MWIS…

cs.DM2015★ 4 cited

Weighted Efficient Domination in Classes of $P_{6}$ -free Graphs

Andreas Brandstadt, T. Karthick

In a graph $G$ , an efficient dominating set is a subset $D$ of vertices such that $D$ is an independent set and each vertex outside $D$ has exactly one neighbor in $D$ . The Minimum…

Weighted Independent Sets in a Subclass of P6​-free Graphs

Weighted Efficient Domination in Classes of P6​-free Graphs

Weighted Independent Sets in a Subclass of $P_{6}$ -free Graphs

Weighted Efficient Domination in Classes of $P_{6}$ -free Graphs