Optimum domination in weighted trees
From MaRDI portal
Publication:1251239
DOI10.1016/0020-0190(78)90012-1zbMath0391.05046MaRDI 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
Algorithm; Facility Location; Optimum Domination in Weighted Trees; Optimum Domination Problem; Star Subgraph; Transmitter
05C05: Trees
05C99: Graph theory
05-04: Software, source code, etc. for problems pertaining to combinatorics
Related Items
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, 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., A linear algorithm for the domination number of a series-parallel graph, 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
Cites Work
