Acyclic domination on bipartite permutation graphs
type: Item
instance of: scholarly article
title: Acyclic domination on bipartite permutation graphs
zbMATH Open document ID: 1184.05092
author: Guangjun Xu
author: Erfang Shan
author: Liying Kang
published in: Information Processing Letters
publication date: 2010-01-29T00:00:00Z
Mathematics Subject Classification ID: 05C69
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 5664473
zbMATH Keywords: algorithms
zbMATH Keywords: dominating set
zbMATH Keywords: acyclic dominating set
zbMATH Keywords: bipartite permutation graph
MaRDI profile type: Publication
full work available at URL: j.ipl.2006.04.002
OpenAlex ID: W1990345395
cites work: Q5422499
cites work: An optimal algorithm for finding the minimum cardinality dominating set on permutation graphs
cites work: Q4368728
cites work: Q4368729
cites work: Acyclic domination
cites work: Solving the weighted efficient edge domination problem on bipartite permutation graphs
cites work: Weighted efficient domination problem on some perfect graphs
cites work: Bipartite permutation graphs
cites work: Edge domination on bipartite permutation graphs and cotriangulated graphs
DOI: 10.1016/J.IPL.2006.04.002
description: scientific article; zbMATH DE number 5664473