Exact Algorithms for Weak Roman Domination

DOI10.1007/978-3-642-45278-9_8MaRDI QIDQ2870018zbMATH OpenOpenAlexFDO

Authors Mathieu Chapelle, Manfred Cochefert, Jean-François Couturier, Dieter Kratsch, Mathieu Liedloff, Anthony Perez

Publication date 17 January 2014

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

Full work available at URL https://doi.org/10.1007/978-3-642-45278-9_8

zbMATH Keywords

exact algorithmgraph algorithmRoman domination

Mathematics Subject Classification ID

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

Recommendations

• Exact algorithms for weak Roman domination
• Algorithmic complexity of weakly connected Roman domination in graphs
• Algorithmic aspects of Roman domination in graphs
• Efficient algorithms for Roman domination on some classes of graphs
• On the computational complexity aspects of perfect Roman domination
• Weak Roman domination in graphs
• scientific article; zbMATH DE number 6129508
• Algorithmic results in Roman dominating functions on graphs
• Algorithmic Aspects of Quasi-Total Roman Domination in Graphs
• Algorithmic and complexity aspects of problems related to total Roman domination for graphs

Cited in

(5)

• Improved integer linear programming formulation for weak Roman domination problem
• Exact algorithms for weak Roman domination
• Minimal Roman dominating functions: extensions and enumeration
• Minimal Roman dominating functions: extensions and enumeration
• Roman census: enumerating and counting Roman dominating functions on graph classes

This page was built for publication: Exact Algorithms for Weak Roman Domination

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