Weighted efficient domination in two subclasses of \(P_6\)-free graphs
type: Item
instance of: scholarly article
title: Weighted efficient domination in two subclasses of \(P_6\)-free graphs
zbMATH Open document ID: 1329.05225
author: T. Karthick
author: Andreas Brandstädt
published in: Discrete Applied Mathematics
publication date: 2016-02-04T00:00:00Z
Mathematics Subject Classification ID: 05C69
Mathematics Subject Classification ID: 05C85
zbMATH DE Number: 6539073
zbMATH Keywords: graph algorithms
zbMATH Keywords: domination in graphs
zbMATH Keywords: efficient domination
zbMATH Keywords: perfect code
zbMATH Keywords: \(P_6\)-free graphs
MaRDI profile type: Publication
full work available at URL: j.dam.2015.07.032
OpenAlex ID: W1174822088
cites work: Perfect codes in graphs
cites work: Polynomial-time algorithms for weighted efficient domination problems in AT-free graphs and dually chordal graphs
cites work: Addendum to: ``Maximum weight independent sets in hole- and co-chair-free graphs''
cites work: On clique separators, nearly chordal graphs, and the Maximum Weight Stable Set Problem
cites work: On independent vertex sets in subclasses of apple-free graphs
cites work: A note on efficient domination in a superclass of \(P_5\)-free graphs
cites work: Graph Classes: A Survey
cites work: New Polynomial Cases of the Weighted Efficient Domination Problem
cites work: Weighted domination of cocomparability graphs
cites work: Polynomial algorithms for the weighted perfect domination problems on chordal graphs and split graphs
cites work: Weighted independent perfect domination on cocomparability graphs
cites work: Q4017197
cites work: Q4093489
cites work: Q4198056
cites work: Efficient edge domination problems in graphs
cites work: Corrigendum to our paper ''The ellipsoid method and its consequences in combinatorial optimization''
cites work: Q4368728
cites work: New Polynomial Case for Efficient Domination in P 6-free Graphs
cites work: Maximum weight independent sets in classes related to claw-free graphs
cites work: Independence and Efficient Domination on P6-free Graphs
cites work: Independent Set in P5-Free Graphs in Polynomial Time
cites work: A polynomial algorithm to find an independent set of maximum weight in a fork-free graph
cites work: Weighted efficient domination problem on some perfect graphs
cites work: Solving the weighted efficient edge domination problem on bipartite permutation graphs
cites work: Hereditary Efficiently Dominatable Graphs
cites work: Q4390693
cites work: Multiplying matrices faster than coppersmith-winograd
cites work: The weighted perfect domination problem and its variants
DOI: 10.1016/J.DAM.2015.07.032
description: scientific article; zbMATH DE number 6539073