✦ LIBER ✦

Exact algorithms for dominating set

✍ Scribed by Johan M.M. van Rooij; Hans L. Bodlaender

Book ID: 113564642
Publisher: Elsevier Science
Year: 2011
Tongue: English
Weight: 410 KB
Volume: 159
Category: Article
ISSN: 0166-218X
DOI: 10.1016/j.dam.2011.07.001

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

[Lecture Notes in Computer Science] Grap

[Lecture Notes in Computer Science] Graph-Theoretic Concepts in Computer Science Volume 3353 || Exact (Exponential) Algorithms for the Dominating Set Problem

✍ Hromkovič, Juraj; Nagl, Manfred; Westfechtel, Bernhard 📂 Article 📅 2004 🏛 Springer Berlin Heidelberg 🌐 German ⚖ 220 KB

During Its 30-year Existence, The International Workshop On Graph-theoretic Concepts In Computer Science Has Become A Distinguished And High-quality Computer Science Event. The Workshop Aims At Uniting Theory And Practice By Demonstrating How Graph-theoretic Concepts Can Successfully Be Applied To V

Approximation Algorithms for Steiner Con

Approximation Algorithms for Steiner Connected Dominating Set

✍ Ya-Feng Wu; Yin-Long Xu; Guo-Liang Chen 📂 Article 📅 2005 🏛 Springer 🌐 English ⚖ 299 KB

An Exact Exponential Time Algorithm forP

An Exact Exponential Time Algorithm forPower Dominating Set

✍ Daniel Binkele-Raible; Henning Fernau 📂 Article 📅 2011 🏛 Springer 🌐 English ⚖ 829 KB

Algorithms for minimum -connected -tuple

Algorithms for minimum -connected -tuple dominating set problem

✍ Weiping Shang; Pengjun Wan; Frances Yao; Xiaodong Hu 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 218 KB

On-line algorithms for the dominating se

On-line algorithms for the dominating set problem

✍ Gow-Hsing King; Wen-Guey Tzeng 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 346 KB

Hybrid metaheuristic algorithms for mini

Hybrid metaheuristic algorithms for minimum weight dominating set

✍ Potluri, Anupama; Singh, Alok 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 416 KB