Optimum domination in weighted trees
From MaRDI portal
Publication:1251239
DOI10.1016/0020-0190(78)90012-1zbMath0391.05046OpenAlexW2008610435MaRDI QIDQ1251239
Publication date: 1978
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(78)90012-1
AlgorithmFacility LocationOptimum Domination in Weighted TreesOptimum Domination ProblemStar SubgraphTransmitter
Trees (05C05) Graph theory (05C99) Software, source code, etc. for problems pertaining to combinatorics (05-04)
Related Items (18)
On the Algorithmic Complexity of Total Domination ⋮ The k-Domination and k-Stability Problems on Sun-Free Chordal Graphs ⋮ A linear algorithm for finding a minimum dominating set in a cactus ⋮ Best location of service centers in a treelike network under budget constraints ⋮ On independent \([1, 2\)-sets in trees] ⋮ The weighted perfect domination problem ⋮ Independent domination in chordal graphs ⋮ The bottleneck independent domination on the classes of bipartite graphs and block graphs. ⋮ Dominating cliques in graphs ⋮ Two algorithms for determining a minimum independent dominating set ⋮ The algorithmic complexity of mixed domination in graphs ⋮ Dominating cliques in graphs ⋮ On \(f\)-domination: polyhedral and algorithmic results ⋮ The \(k\)-power domination problem in weighted trees ⋮ A linear algorithm for the domination number of a series-parallel graph ⋮ 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
Cites Work
This page was built for publication: Optimum domination in weighted trees
