scientific article; zbMATH DE number 4117855

MaRDI QIDQ4732113zbMATH OpenFDO

Authors Philip N. Klein

Publication date 1989

zbMATH Keywords

directed graphpreprocessingreachabilitysparse graphs

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Parallel algorithms and correctness in parallel programs
• scientific article; zbMATH DE number 4020458
• Theoretical and applied aspects of structured parallel programming
• Foundations of Parallel Programming
• Theory and practice of parallelism detection in sequential programs
• scientific article; zbMATH DE number 4047042
• scientific article; zbMATH DE number 1949583
• Structural synthesis of parallel programs (methodology and tools)
• scientific article; zbMATH DE number 107700

Cited in

(12)

• On the parallel complexity of digraph reachability
• Interdefinability of parallel operations in PCF
• scientific article; zbMATH DE number 4172382 (Why is no real title available?)
• Fast Detection of Stable and Count Predicates in Parallel Computations
• Parallel Repetition of Computationally Sound Protocols Revisited
• scientific article; zbMATH DE number 4070282 (Why is no real title available?)
• Expressibility and Parallel Complexity
• scientific article; zbMATH DE number 1096856 (Why is no real title available?)
• Parallelism, Preprocessing, and Reachability: A Hybrid Algorithm for Directed Graphs
• Non-speculative and upward invocation of continuations in a parallel language
• Parallel processing of graph reachability in databases
• On the time-space complexity of reachability queries for preprocessed graphs

This page was built for publication:

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