Skip Navigation


The Computer Journal Advance Access originally published online on July 23, 2008
The Computer Journal 2009 52(2):268-275; doi:10.1093/comjnl/bxn037
This Article
Right arrow Full Text
Right arrow Full Text (PDF)
Right arrow All Versions of this Article:
52/2/268    most recent
bxn037v1
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Li, Y.
Right arrow Articles by Chu, W.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© The Author 2008. Published by Oxford University Press on behalf of The British Computer Society. All rights reserved. For Permissions, please email: journals.permissions@oxfordjournals.org

Optimal Algorithms for Finding a Trunk on a Tree Network and its Applications

Yamin Li1,*, Shietung Peng1 and Wanming Chu2

1 Department of Computer Science, Hosei University, Tokyo 184-8584, Japan
2 Department of Computer Hardware, University of Aizu, Aizu-Wakamatsu 965-8580, Japan

* Corresponding author: yamin{at}hosei.ac.jp

Received 26 December 2007; revised 14 May 2008

Given an edge-weighted tree T, a trunk is a path P in T which minimizes the sum of the distances of all vertices in T from P plus the weight of path P. In this paper, we give efficient algorithms for finding a trunk of T. The first algorithm is a sequential algorithm which runs in O(n) time, where n is the number of vertices in T. The second algorithm is a parallel algorithm which runs in O(log n) time using O(n/log n) processors on the EREW PRAM model. We present an application of trunk on mobile ad hoc networks for efficient multicasting.

Key Words: tree network • algorithm • wireless ad hoc networks


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer: Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.