Optimal root choice for parallel processing of tree decompositions Online publication date: Tue, 23-Feb-2010
by Yueping Li, Zhe Nie, Yunting Lu
International Journal of Intelligent Information and Database Systems (IJIIDS), Vol. 4, No. 1, 2010
Abstract: This paper deals with the root choice strategy for tree decomposition when multiple agents (processors) are deployed. Tree decomposition is one of the most important decompositions in graph theory. It not only plays a role in theoretical investigations but also has widely practical applications. The reason is that many hard problems can be divided into sub-problems within the nodes in tree decomposition. When solving problems in tree decomposition, the precedence constraints graph takes the form of a tree. The first step is to choose a root since tree decomposition does not define any root. In addition, the root choice affects the time complexity when parallel processing is employed. The main findings of this paper are: a) an algorithm for determining the root which makes the latest completion time minimum; b) some results of the allocation of the optimal root; c) an improved version algorithm using branch-and-bound strategy based on the results. In addition, remarks and future works are presented.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Intelligent Information and Database Systems (IJIIDS):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook