Efficient parallel algorithms for tree-decomposition and related problems

An efficient parallel algorithm for the tree-decomposition problem for fixed width w is presented. The algorithm runs in time O(log/sup 3/ n) and uses O(n) processors on a concurrent-read, concurrent-write parallel random access machine (CRCW PRAM). This result can be used to construct efficient par...

Full description

Saved in:
Bibliographic Details
Published inFoundations of Computer Science, 31st Symposium pp. 173 - 182 vol.1
Main Author Lagergren, J.
Format Conference Proceeding
LanguageEnglish
Published IEEE Comput. Soc. Press 1990
Subjects
Computational modeling
Concurrent computing
Logic
Medical services
Numerical analysis
Parallel algorithms
Phase change random access memory
Polynomials
Stress
Tree graphs
Online AccessGet full text
ISBN081862082X
9780818620829
DOI10.1109/FSCS.1990.89536

Cover

More Information
Summary:An efficient parallel algorithm for the tree-decomposition problem for fixed width w is presented. The algorithm runs in time O(log/sup 3/ n) and uses O(n) processors on a concurrent-read, concurrent-write parallel random access machine (CRCW PRAM). This result can be used to construct efficient parallel algorithms for three important classes of problems: MS (monadic second-order) properties, linear EMS (extended monadic second-order) extremum problems, and enumeration problems for MS properties, for graphs of tree width at most w. The sequential time complexity of the tree-composition problem for fixed w is improved, and some implications for this improvement are stated.< >
ISBN:081862082X
9780818620829
DOI:10.1109/FSCS.1990.89536