Polynomial algorithms for the weighted perfect domination problems on chordal graphs and split graphs
type: Item
instance of: scholarly article
title: Polynomial algorithms for the weighted perfect domination problems on chordal graphs and split graphs
zbMATH Open document ID: 0787.68077
DOI: 10.1016/0020-0190(93)90147-2
author: Maw-Shang Chang
author: Yichang Liu
published in: Information Processing Letters
publication date: 1994-02-24T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 05C85
zbMATH DE Number: 500539
zbMATH Keywords: linear algorithms
zbMATH Keywords: perfect domination
zbMATH Keywords: chordal graphs
zbMATH Keywords: split graphs
MaRDI profile type: MaRDI publication profile
full work available at URL: 0020-0190(93)90147-2
OpenAlex ID: W1969612844
cites work: Q3815323
cites work: Perfect codes in graphs
cites work: Q4894998
cites work: Nearly perfect sets in graphs
cites work: Q4017197
cites work: The intersection graphs of subtrees in trees are exactly the chordal graphs
cites work: Perfect codes in the graphs \(O_k\)
cites work: Perfect codes over graphs
cites work: Q5284096
cites work: Algorithmic Aspects of Vertex Elimination on Graphs
cites work: The weighted perfect domination problem
Recommended article: Polynomial-time algorithms for weighted efficient domination problems in AT-free graphs and dually chordal graphs
Recommended article: New Polynomial Cases of the Weighted Efficient Domination Problem
Recommended article: Weighted efficient domination problem on some perfect graphs
Recommended article: Polynomial Algorithms for Some Hard Problems of Finding Connected Spanning Subgraphs of Extreme Total Edge Weight
Recommended article: Polynomial-time algorithm for weighted efficient domination problem on diameter three planar graphs
Recommended article: Polynomial algorithms for partitioning problems on graphs with fixed clique-width (extended abstract)
Recommended article: Q3216686
Recommended article: A Polynomial Delay Algorithm for Enumerating Minimal Dominating Sets in Chordal Graphs
Recommended article: The weighted perfect domination problem and its variants
Recommended article: Q3978339
description: scientific article; zbMATH DE number 500539