Optimal broadcast domination in polynomial time
DOI10.1016/J.DISC.2006.06.013zbMATH Open1115.68115OpenAlexW1987801337MaRDI QIDQ856876FDOQ856876
Daniel Lokshtanov, Pinar Heggernes
Publication date: 14 December 2006
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2006.06.013
Recommendations
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- How to Allocate Network Centers
- Title not available (Why is that?)
- `` Strong NP-Completeness Results
- Broadcasts in graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- R -Domination in Graphs
- Title not available (Why is that?)
- Graph-Theoretic Concepts in Computer Science
Cited In (40)
- General bounds on limited broadcast domination
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the broadcast independence number of grid graph
- Broadcast domination and multipacking in strongly chordal graphs
- Title not available (Why is that?)
- 2-limited dominating broadcasts on cubic graphs without induced 4-cycles
- Broadcast-optimal two-round MPC
- New bounds for the broadcast domination number of a graph
- Optimal domination polynomials
- On the complexity of broadcast domination and multipacking In digraphs
- Algorithmic aspects of broadcast independence
- On the broadcast independence number of caterpillars
- Relating broadcast independence and independence
- Global dominating broadcast in graphs
- Asymptotically Optimal Bounds for (t,2) Broadcast Domination on Finite Grids
- Title not available (Why is that?)
- On the Complexity of Broadcast Domination and Multipacking in Digraphs
- Dominating 2-broadcast in graphs: Complexity, bounds and extremal graphs
- On the complexity of the shortest-path broadcast problem
- Broadcast domination and multipacking: bounds and the integrality gap
- 2-limited broadcast domination on grid graphs
- On the broadcast independence number of circulant graphs
- On the broadcast domination number of permutation graphs
- \(k\)-broadcast domination and \(k\)-multipacking
- Graph-Theoretic Concepts in Computer Science
- Broadcast Domination in Graphs
- Exponential domination in subcubic graphs
- A linear‐time algorithm for broadcast domination in a tree
- Broadcasts and domination in trees
- Bounds on the sum of broadcast domination number and strong metric dimension of graphs
- Bounds on the exponential domination number
- Dominating and irredundant broadcasts in graphs
- Minimizing setup in broadcast-optimal two round MPC
- A decomposition approach for solving a broadcast domination network design problem
- Broadcast domination in subcubic graphs
- Radial trees
- Relation between broadcast domination and multipacking numbers on chordal graphs
- Broadcasts on paths and cycles
- 2-limited broadcast domination in subcubic graphs
This page was built for publication: Optimal broadcast domination in polynomial time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q856876)
