Exact Algorithms for Weak Roman Domination

DOI10.1007/978-3-642-45278-9_8zbMath1408.68112OpenAlexW166957555MaRDI QIDQ2870018

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

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

graph algorithmexact algorithmRoman domination

Mathematics Subject Classification ID

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

Related Items (3)

Improved integer linear programming formulation for weak Roman domination problem ⋮ Exact algorithms for weak Roman domination ⋮ Minimal Roman dominating functions: extensions and enumeration

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