✦ LIBER ✦

An efficient distributed algorithm for constructing small dominating sets

✍ Scribed by Lujun Jia; Rajmohan Rajaraman; Torsten Suel

Publisher: Springer-Verlag
Year: 2002
Tongue: English
Weight: 227 KB
Volume: 15
Category: Article
ISSN: 0178-2770
DOI: 10.1007/s00446-002-0078-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A distributed algorithm for k-dominating

A distributed algorithm for k-dominating sets

✍ Lucia Draque Penso; Valmir Carneiro Barbosa 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 213 KB

A new distributed approximation algorith

A new distributed approximation algorithm for constructing minimum connected dominating set in wireless ad hoc networks

✍ Bo Gao; Yuhang Yang; Huiye Ma 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 516 KB

An efficient algorithm for constructing

An efficient algorithm for constructing Hamiltonian paths in meshes

✍ Shao Dong Chen; Hong Shen; Rodney Topor 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 169 KB

This paper presents an efficient linear-time sequential algorithm for constructing Hamiltonian paths between two given vertices in meshes with horizontal size m and vertical size n. The algorithm first partitions the given mesh into a number of submeshes in constant steps, and then constructs a Hami

An efficient distributed algorithm for g

An efficient distributed algorithm for game tree search

✍ Sun Wei; Ma Shaohan 📂 Article 📅 1996 🏛 Wuhan University 🌐 English ⚖ 223 KB

An algorithm for constructing basis sets

An algorithm for constructing basis sets of wave functions with required properties

✍ V. A. Mazur; Yu. A. Pochkin 📂 Article 📅 1983 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 179 KB

Yucca: An Efficient Algorithm for Small-

Yucca: An Efficient Algorithm for Small-Molecule Docking

✍ Vicky Choi 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 355 KB