Graph-Theoretic Concepts in Computer Science

DOI10.1007/11604686zbMATH Open1171.05389MaRDI QIDQ5897548FDOQ5897548

Authors: Mathieu Liedloff, Ton Kloks, Jiping Liu, Sheng-Lung Peng 

Publication date: 1 November 2006

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Recommendations

• Efficient algorithms for Roman domination on some classes of graphs
• Roman domination in graphs.
• On the Roman domination polynomial of graphs
• Total roman domination in graphs
• Algorithmic aspects of Roman graphs

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cited In (14)

• On the Roman domination polynomial of graphs
• Upper bounds on Roman domination numbers of graphs
• Roman \(k\)-domination: hardness, approximation and parameterized results
• Approximation algorithm for the minimum partial connected Roman dominating set problem
• Improved integer linear programming formulation for weak Roman domination problem
• Efficient algorithms for Roman domination on some classes of graphs
• Roman domination in subgraphs of grids
• The Roman domination number of some special classes of graphs - convex polytopes
• The \(k\)-th Roman domination problem is polynomial on interval graphs
• Nearly tight approximation algorithm for (connected) Roman dominating set
• Title not available (Why is that?)
• Roman domination excellent graphs: trees
• Approximation algorithm for a generalized Roman domination problem in unit ball graphs
• Domination problems on \(P_{5}\)-free graphs

This page was built for publication: Graph-Theoretic Concepts in Computer Science

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5897548)