Randomized algorithms and upper bounds for multiple domination in graphs and networks

DOI10.1016/j.dam.2011.07.004zbMath1259.05165OpenAlexW1986858995MaRDI QIDQ1941386

Anush Poghosyan, Andrei Gagarin, Vadim E. Zverovich

Publication date: 12 March 2013

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2011.07.004

zbMATH Keywords

randomized algorithm\(\alpha \)-domination\(k\)-tuple domination\(k\)-domination\(\alpha \)-rate domination

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Randomized algorithms (68W20)

Related Items (6)

Multiple domination models for placement of electric vehicle charging stations in road networks ⋮ Heuristics for \(k\)-domination models of facility location problems in street networks ⋮ Upper bounds on the balanced \(\langle \mathbf{r}, \mathbf{s} \rangle\)-domination number of a graph ⋮ A note on \(\alpha\)-total domination in cubic graphs ⋮ The probabilistic approach to limited packings in graphs ⋮ On general frameworks and threshold functions for multiple domination

This page was built for publication: Randomized algorithms and upper bounds for multiple domination in graphs and networks