scientific article; zbMATH DE number 2170461
From MaRDI portal
Publication:4677956
zbMath1066.05138MaRDI QIDQ4677956
Pinar Heggernes, Fredrik Manne, Steve Horton, Jean R. S. Blair
Publication date: 23 May 2005
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (15)
Algorithmic aspects of broadcast independence ⋮ On the Complexity of Broadcast Domination and Multipacking in Digraphs ⋮ Optimal broadcast domination in polynomial time ⋮ Broadcasts on paths and cycles ⋮ 2-limited broadcast domination in subcubic graphs ⋮ New bounds for the broadcast domination number of a graph ⋮ On the broadcast independence number of grid graph ⋮ A decomposition approach for solving a broadcast domination network design problem ⋮ On the complexity of broadcast domination and multipacking In digraphs ⋮ On the broadcast independence number of caterpillars ⋮ A linear‐time algorithm for broadcast domination in a tree ⋮ On the broadcast domination number of permutation graphs ⋮ Bounds on the sum of broadcast domination number and strong metric dimension of graphs ⋮ Broadcast Domination in Graphs ⋮ Broadcast domination in subcubic graphs
This page was built for publication:
