The Swap Edges of a Multiple-Sources Routing Tree

Author： Wu Bang   Hsiao Chih-Yuan   Chao Kun-Mao  

Publisher： Springer Publishing Company

ISSN： 0178-4617

Source： Algorithmica, Vol.50, Iss.3, 2008-03, pp. : 299-311

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 multi-tree routing scheme using acyclic orientations

By Annexstein  

Theoretical Computer Science, Vol. 240, Iss. 2, 2000-06 ,pp. : 487-494

Elsevier

Access to resources Recommend Favorite

SHORT: shortest hop routing tree for wireless sensor networks

By Yang Yang   Wu Hui-Hai   Chen Hsiao-Hwa  

International Journal of Sensor Networks, Vol. 2, Iss. 5-6, 2007-07 ,pp. : 368-374

Inderscience Publishers

Access to resources Recommend Favorite

电力线载波通信网络的树簇路由算法设计 Cluster Tree Routing Algorithm Design for Power Line Communication Networks

By 潘萍  

Software Engineering and Applications, Vol. 01, Iss. 02, 2012-12 ,pp. : 38-42

汉斯出版社

Access to resources Recommend Favorite

Parallel approximation algorithms for minimum routing cost spanning tree

By Chen Kun   Hsieh Yung En   Lu Ping Jung  

International Journal of Computational Science and Engineering, Vol. 8, Iss. 4, 2013-10 ,pp. : 336-348

Inderscience Publishers

Access to resources Recommend Favorite

Design and Implementation of Binary Tree Based Proactive Routing Protocols for Large MANETS

By  

International Journal of Handheld Computing Research (IJHCR), Vol. 2, Iss. 4, 2011-10 ,pp. : 82-94

IGI Global_journal

Access to resources Recommend Favorite