A dynamic domination problem in trees
From MaRDI portal
(Redirected from A dynamic domination problem in trees)
Recommendations
- scientific article; zbMATH DE number 3918387
- A Dynamic Domination Problem
- A Dynamic Programming Approach to the Dominating Set Problem on k-Trees
- Domination between trees and application to an explosion problem
- scientific article; zbMATH DE number 1472178
- Domination and edge domination in trees
- Optimal dynamic program for r-domination problems over tree decompositions
- The \(k\)-power domination problem in weighted trees
- The k-power domination problem in weighted trees
Cites work
- Construction of trees and graphs with equal domination parameters
- Edge protection in graphs
- Eternal protection in grid graphs
- Eternal security in graphs of fixed independence number
- Eternal total domination in graphs.
- Graphs with equal eternal vertex cover and eternal domination numbers
- scientific article; zbMATH DE number 5575574 (Why is no real title available?)
- scientific article; zbMATH DE number 1507962 (Why is no real title available?)
- scientific article; zbMATH DE number 2174620 (Why is no real title available?)
- scientific article; zbMATH DE number 2104838 (Why is no real title available?)
- Maximum-demand graphs for eternal security
- Tight bounds for eternal dominating sets in graphs
- Vertex covers and eternal dominating sets
Cited in
(3)
This page was built for publication: A dynamic domination problem in trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5134345)