Abstract
We present an efficient parallel algorithm for the tree-decomposition problem for fixed widthw. The algorithm runs in time O(log3n) and uses O(n) processors on an ARBITRARY CRCW PRAM. The sequential complexity of our tree-decomposition algorithm is O(nlog2n). The tree-decomposition algorithm enables us to construct efficient parallel algorithms for a broad class of problems, when restricted to graphs of tree-width at mostw. Many of these problems areNP-complete for general graphs.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
