A Distributed Algorithm for Computing the Node Search Number in Trees

Author： Coudert David Huc Florian Mazauric Dorian

ISSN： 0178-4617

Source： Algorithmica, Vol.63, Iss.1-2, 2012-06, pp. : 158-190

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Related content

A fast distributed approximation algorithm for minimum spanning trees

By Khan Maleq Pandurangan Gopal

Distributed Computing, Vol. 20, Iss. 6, 2008-04 ,pp. : 391-402

Springer Publishing Company

Access to resources Recommend Favorite

An Improved Algorithm for Module Allocation in Distributed Computing Systems

By Tom P A. Siva Ram Murthy C.

Journal of Parallel and Distributed Computing, Vol. 42, Iss. 1, 1997-04 ,pp. : 82-90

Academic Press

Access to resources Recommend Favorite

A linear-time optimal-message distributed algorithm for minimum spanning trees

By Faloutsos Michalis Molle Mart

Distributed Computing, Vol. 17, Iss. 2, 2004-08 ,pp. : 151-170

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

Dynamic Tasks Scheduling Algorithm for Distributed Computing Systems under Fuzzy Environment

International Journal of Fuzzy System Applications (IJFSA), Vol. 5, Iss. 4, 2016-10 ,pp. : 77-95

IGI Global_journal

Access to resources Recommend Favorite