Observations on parallel computation of transitive and max-closure problems

DOI10.1007/3-540-45825-5_37MaRDI QIDQ4412042zbMATH OpenFDO

Authors Aris Pagourtzis, Igor Potapov, Wojciech Rytter

Publication date 13 July 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2474/24740217.htm

Mathematics Subject Classification ID

Computing methodologies and applications (68U99) Parallel algorithms in computer science (68W10)

Recommendations

• PVM computation of the transitive closure: The dependency graph approach
• Coarse-Grained Parallel Transitive Closure Algorithm: Path Decomposition Technique
• High-Probability Parallel Transitive-Closure Algorithms
• Parallel Transitive Closure and Point Location in Planar Structures
• scientific article; zbMATH DE number 813252

Cited in

(4)

• Design, implementation, and analysis of maximum transversal algorithms
• scientific article; zbMATH DE number 2089168 (Why is no real title available?)
• scientific article; zbMATH DE number 15249 (Why is no real title available?)
• PVM computation of the transitive closure: The dependency graph approach

This page was built for publication: Observations on parallel computation of transitive and max-closure problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4412042)