Related content

An Algorithm for Strongly Connected Component Analysis in n log n Symbolic Steps

By Bloem Roderick   Gabow Harold   Somenzi Fabio  

Formal Methods in System Design, Vol. 28, Iss. 1, 2006-01 ,pp. : 37-56

Springer Publishing Company

Access to resources Recommend Favorite

Connected dominating set algorithms for wireless sensor networks

By Al-Nabhan Najla  

International Journal of Sensor Networks, Vol. 13, Iss. 2, 2013-05 ,pp. : 121-134

Inderscience Publishers

Access to resources Recommend Favorite

Improving Construction for Connected Dominating Set with Steiner Tree in Wireless Sensor Networks

By Min Manki   Du Hongwei   Jia Xiaohua   Huang Christina   Huang Scott   Wu Weili  

Journal of Global Optimization, Vol. 35, Iss. 1, 2006-05 ,pp. : 111-119

Springer Publishing Company

Access to resources Recommend Favorite

A distributed algorithm for computing Connected Dominating Set in ad hoc networks

By Huang Chuanhe   Qin Chuan   Xian Yi  

International Journal of Wireless and Mobile Computing, Vol. 1, Iss. 2, 2007-02 ,pp. : 148-155

Inderscience Publishers

Access to resources Recommend Favorite

Vasil’ev codes of length n = 2^m and doubling of Steiner systems S(n, 4, 3) of a given rank

By Zinoviev V.   Zinoviev D.  

Problems of Information Transmission, Vol. 42, Iss. 1, 2006-03 ,pp. : 10-29

MAIK Nauka/Interperiodica

Access to resources Recommend Favorite