Lower Bounds and Algorithms for Dominating Sets in Web Graphs
From MaRDI portal
Publication:5474650
DOI10.1080/15427951.2005.10129105zbMath1110.68095OpenAlexW2040631047MaRDI QIDQ5474650
Ralf Klasing, Colin Cooper, Michele Zito
Publication date: 26 June 2006
Published in: Internet Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/15427951.2005.10129105
Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10)
Related Items
Dominating problems in swapped networks ⋮ Upper bounds for \(\alpha \)-domination parameters ⋮ Giant descendant trees, matchings, and independent sets in age-biased attachment graphs ⋮ Benders Decomposition, Branch-and-Cut, and Hybrid Algorithms for the Minimum Connected Dominating Set Problem ⋮ The Domination Number of On-line Social Networks and Random Geometric Graphs ⋮ The iterated local transitivity model for tournaments ⋮ Techniques for analyzing dynamic random graph models of web-like networks: An overview ⋮ On the complexity of the minimum domination problem restricted by forbidden induced subgraphs of small size ⋮ Unnamed Item ⋮ Independent strong domination in complementary prisms ⋮ Uncertain weighted dominating set: a prototype application on natural disaster relief management ⋮ Vertex Pursuit Games in Stochastic Network Models ⋮ Near-Optimal Dominating Sets via Random Sampling ⋮ Upper signed \(k\)-domination in a general graph ⋮ Domination problems on P5-free graphs ⋮ Independent strong weak domination: A mathematical programming approach
