A note on root choice for parallel processing of tree decompositions

Authors:
Yueping Li;Yunting Lu
Affiliations:
Department of Computer Science, Sun Yat-sen University, Guangzhou, P.R., China;Shenzhen Institute of Information Technology, Shenzhen, P.R., China
Venue:
KES-AMSTA'08 Proceedings of the 2nd KES International conference on Agent and multi-agent systems: technologies and applications
Year:
2008

Citing 8
Cited 0

Efficient algorithms for combinatorial problems on graphs with bounded, decomposability—a survey

BIT - Ellis Horwood series in artificial intelligence
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
Fiber Network Service Survivability

Fiber Network Service Survivability
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

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper deals with the root choice strategy for a 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 [4]. The first step of solving problem using tree decomposition is to choose a root. And the root choice affects the time complexity when parallel processing is employed. We propose an algorithm to determine the root which makes the latest completion time minimum. In addition, remarks and future works are given.