Efficient algorithms for Roman domination on some classes of graphs
type: Item
instance of: scholarly article
title: Efficient algorithms for Roman domination on some classes of graphs
zbMATH Open document ID: 1180.05113
author: Mathieu Liedloff
author: Ton Kloks
author: Sheng-Lung Peng
author: Jiping Liu
published in: Discrete Applied Mathematics
publication date: 2009-03-04T00:00:00Z
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 05C69
zbMATH DE Number: 5523194
zbMATH Keywords: graph algorithms
zbMATH Keywords: Roman domination
zbMATH Keywords: interval graphs
zbMATH Keywords: cographs
zbMATH Keywords: AT-free graphs
zbMATH Keywords: weight of a Roman dominating function
MaRDI profile type: Publication
full work available at URL: j.dam.2008.01.011
OpenAlex ID: W2013474931
cites work: Graph Classes: A Survey
cites work: Roman domination in graphs.
cites work: Linear time algorithms for dominating pairs in asteroidal triple-free graphs
cites work: Asteroidal Triple-Free Graphs
cites work: Linear time solvable optimization problems on graphs of bounded clique-width
cites work: Upper bounds to the clique width of graphs
cites work: Algorithms for graphs with small octopus
cites work: A simple linear time algorithm for cograph recognition
cites work: Defending the Roman Empire from multiple attacks
cites work: Defending the Roman Empire---a new strategy
cites work: Approximating the bandwidth for asteroidal triple-free graphs
cites work: Domination and total domination on asteroidal triple-free graphs
cites work: Defendens Imperium Romanum: A Classical Problem in Military Strategy
DOI: 10.1016/J.DAM.2008.01.011
description: scientific article; zbMATH DE number 5523194