A linear algorithm for double Roman domination of proper interval graphs
From MaRDI portal
Publication:5216450
Recommendations
Cites work
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
- A linear time algorithm to compute a minimum restrained dominating set in proper interval graphs
- Defendens Imperium Romanum: A Classical Problem in Military Strategy
- Double Roman domination
- Double Roman domination in trees
- New algorithms for weighted \(k\)-domination and total \(k\)-domination problems in proper interval graphs
- On the double Roman domination in graphs
- On the double Roman domination of graphs
- Secure domination in proper interval graphs
Cited in
(6)- Clique doubly connected domination in the join and lexicographic product of graphs
- Algorithmic results on double Roman domination in graphs
- Efficient algorithms for Roman domination on some classes of graphs
- Outer independent double Italian domination: Complexity, characterization
- The \(k\)-th Roman domination problem is polynomial on interval graphs
- Linear algorithm for domatic number problem on interval graphs
This page was built for publication: A linear algorithm for double Roman domination of proper interval graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5216450)