Optimum domination in weighted trees
From MaRDI portal
Cites work
Cited in
(18)- A linear algorithm for finding a minimum dominating set in a cactus
- Independent domination in chordal graphs
- The bottleneck independent domination on the classes of bipartite graphs and block graphs.
- On independent \([1, 2]\)-sets in trees
- A linear algorithm for the domination number of a series-parallel graph
- On \(f\)-domination: polyhedral and algorithmic results
- The k-power domination problem in weighted trees
- Best location of service centers in a treelike network under budget constraints
- Two algorithms for determining a minimum independent dominating set
- On the Algorithmic Complexity of Total Domination
- The k-Domination and k-Stability Problems on Sun-Free Chordal Graphs
- The algorithmic complexity of mixed domination in graphs
- Dominating cliques in graphs
- Dominating cliques in graphs
- Domination, independent domination, and duality in strongly chordal graphs
- Dominating sets for split and bipartite graphs
- Bibliography on domination in graphs and some basic definitions of domination parameters
- The weighted perfect domination problem
This page was built for publication: Optimum domination in weighted trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1251239)