Linear time algorithms for NP-hard problems restricted to partial k-trees
Discrete Applied Mathematics
Easy problems for tree-decomposable graphs
Journal of Algorithms
All structured programs have small tree width and good register allocation
Information and Computation
Linear algorithms on k-terminal graphs
Linear algorithms on k-terminal graphs
Recursively constructed graph families: membership and linear algorithms
Recursively constructed graph families: membership and linear algorithms
Treewidth: characterizations, applications, and computations
WG'06 Proceedings of the 32nd international conference on Graph-Theoretic Concepts in Computer Science
| Hi-index | 0.00 |
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.