✦ LIBER ✦

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

✍ Scribed by Gagarin, Andrei; Poghosyan, Anush; Zverovich, Vadim

Book ID: 122632831
Publisher: Elsevier Science
Year: 2013
Tongue: English
Weight: 231 KB
Volume: 161
Category: Article
ISSN: 0166-218X
DOI: 10.1016/j.dam.2011.07.004

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Improved Algorithms and Complexity Resul

Improved Algorithms and Complexity Results for Power Domination in Graphs

✍ Jiong Guo; Rolf Niedermeier; Daniel Raible 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 495 KB

Domination in graphs with bounded propag

Domination in graphs with bounded propagation: algorithms, formulations and hardness results

✍ Ashkan Aazami 📂 Article 📅 2008 🏛 Springer US 🌐 English ⚖ 733 KB

Hardness results and approximation algor

Hardness results and approximation algorithms for (weighted) paired-domination in graphs

✍ Lei Chen; Changhong Lu; Zhenbing Zeng 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 532 KB

Labelling algorithms for paired-dominati

Labelling algorithms for paired-domination problems in block and interval graphs

✍ Lei Chen; Changhong Lu; Zhenbing Zeng 📂 Article 📅 2008 🏛 Springer US 🌐 English ⚖ 368 KB

Domination in Graphs Applied to Electric

Domination in Graphs Applied to Electric Power Networks

✍ Haynes, Teresa W.; Hedetniemi, Sandra M.; Hedetniemi, Stephen T.; Henning, Micha 📂 Article 📅 2002 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 162 KB

On the approximability and exact algorit

On the approximability and exact algorithms for vector domination and related problems in graphs

✍ Cicalese, Ferdinando; Milanič, Martin; Vaccaro, Ugo 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 338 KB