A linear‐time algorithm for broadcast domination in a tree
From MaRDI portal
Recommendations
- Broadcast domination on block graphs in linear time
- Broadcasts and domination in trees
- A linear algorithm for r, s -domination of a tree
- Linear algorithms for edge-vertex domination in trees
- scientific article; zbMATH DE number 2170461
- Graph-Theoretic Concepts in Computer Science
- A linear time algorithm for optimal \(k\)-hop dominating set of a tree
- Polynomial-time algorithms for minimum-time broadcast in trees
- A linear algorithm for finding the k‐broadcast center of a tree
- Optimal broadcast domination in polynomial time
Cites work
- Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families
- Broadcast covers in graphs
- Broadcasts in graphs
- Domination, independent domination, and duality in strongly chordal graphs
- Doubly Lexical Orderings of Matrices
- Easy problems for tree-decomposable graphs
- Fast Algorithms for Finding Nearest Common Ancestors
- Finding level-ancestors in trees
- scientific article; zbMATH DE number 3974289 (Why is no real title available?)
- scientific article; zbMATH DE number 2170461 (Why is no real title available?)
- scientific article; zbMATH DE number 2109329 (Why is no real title available?)
- Linear-time computation of optimal subgraphs of decomposable graphs
- Optimal broadcast domination in polynomial time
- The level ancestor problem simplified
- The monadic second-order logic of graphs III : tree-decompositions, minors and complexity issues
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- Totally-Balanced and Greedy Matrices
Cited in
(29)- Radial trees
- On the broadcast independence number of caterpillars
- New bounds for the broadcast domination number of a graph
- On the complexity of broadcast domination and multipacking in digraphs
- Broadcast domination in subcubic graphs
- 2-limited dominating broadcasts on cubic graphs without induced 4-cycles
- Algorithmic aspects of broadcast independence
- Broadcasts on paths and cycles
- 2-limited broadcast domination in subcubic graphs
- Broadcast domination and multipacking in strongly chordal graphs
- On the broadcast independence number of grid graph
- Broadcast domination on block graphs in linear time
- Broadcast domination in graphs
- scientific article; zbMATH DE number 3959487 (Why is no real title available?)
- scientific article; zbMATH DE number 2170461 (Why is no real title available?)
- On the complexity of \textsc{broadcast domination} and \textsc{Multipacking} in digraphs
- Dominating and irredundant broadcasts in graphs
- The shared broadcast tree problem and MST
- A linear algorithm for finding the k‐broadcast center of a tree
- Broadcast domination and multipacking: bounds and the integrality gap
- Broadcasts and domination in trees
- scientific article; zbMATH DE number 7666856 (Why is no real title available?)
- Graph-Theoretic Concepts in Computer Science
- Labeling algorithm for power domination problem of trees
- 2-limited broadcast domination on grid graphs
- On the broadcast independence number of circulant graphs
- On the broadcast independence number of locally uniform 2-lobsters
- Optimal broadcast domination in polynomial time
- A linear time algorithm for optimal \(k\)-hop dominating set of a tree
This page was built for publication: A linear‐time algorithm for broadcast domination in a tree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5191137)
