scientific article; zbMATH DE number 3972201

MaRDI QIDQ3738573zbMATH OpenFDO

Authors Hristo N. Djidjev

Publication date 1985

zbMATH Keywords

parallel graph algorithmsparallel random access machines

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Efficient parallel algorithms for graph problems
• Efficient Parallel Algorithms for a Class of Graph Theoretic Problems
• scientific article; zbMATH DE number 3905859
• scientific article; zbMATH DE number 4068310
• Parallel graph algorithms that are efficients on average
• Efficient parallel algorithms for series parallel graphs
• Parallel computations on graphs
• scientific article; zbMATH DE number 1985710
• Efficient Parallel Algorithms for Chordal Graphs
• Efficient parallel algorithms for permutation graphs

Cited in

(19)

• Efficient parallel algorithms for graph problems
• Efficient parallel graph algorithms for coarse-grained multicomputers and BSP
• Efficient parallel algorithms for permutation graphs
• Designing efficient parallel algorithms on interval graphs
• High Parallel Complexity Graphs and Memory-Hard Functions
• scientific article; zbMATH DE number 3930349 (Why is no real title available?)
• scientific article; zbMATH DE number 4033068 (Why is no real title available?)
• scientific article; zbMATH DE number 4049080 (Why is no real title available?)
• scientific article; zbMATH DE number 4068310 (Why is no real title available?)
• Parallel algorithms for connectivity problems in graph theory
• scientific article; zbMATH DE number 4128411 (Why is no real title available?)
• scientific article; zbMATH DE number 500370 (Why is no real title available?)
• scientific article; zbMATH DE number 1102788 (Why is no real title available?)
• scientific article; zbMATH DE number 1985710 (Why is no real title available?)
• Parallel algorithms for series parallel graphs
• Efficient Parallel Algorithms for Graphs of Bounded Tree-Width
• Nearly work-efficient parallel algorithm for digraph reachability
• scientific article; zbMATH DE number 5033869 (Why is no real title available?)
• Efficient parallel algorithms for doubly convex-bipartite 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 Q3738573)