Efficient parallel graph algorithms for coarse-grained multicomputers and BSP
From MaRDI portal
Recommendations
- Efficient parallel graph algorithms for coarse grained multicomputers and BSP
- Efficient Parallel Algorithms for a Class of Graph Theoretic Problems
- scientific article; zbMATH DE number 3972201
- Efficient parallel algorithms for graph problems
- scientific article; zbMATH DE number 4213472
- scientific article; zbMATH DE number 4068310
- scientific article; zbMATH DE number 1696524
- Parallel algorithms for cographs and parity graphs with applications
- scientific article; zbMATH DE number 139775
Cited in
(15)- Efficient graph-theoretic algorithms on a linear array with a reconfigurable pipelined bus system
- Parallel algorithms for maximal cliques in circle graphs and unrestricted depth search
- Emulations between QSM, BSP and LogP: A framework for general-purpose parallel algorithm design.
- Communication in parallel systems : Models, algorithms and implementations
- Parallel range minima on coarse grained multicomputers
- A bridging model for multi-core computing
- Communication efficient BSP algorithm for all nearest smaller values problem
- Successive approximation in parallel graph algorithms (extended abstract)
- Efficient parallel algorithms for doubly convex-bipartite graphs
- Parallelization strategy for elementary morphological operators on graphs: distance-based algorithms and implementation on multicore shared-memory architecture
- Efficient parallel graph algorithms for coarse grained multicomputers and BSP
- Euro-Par 2004 Parallel Processing
- scientific article; zbMATH DE number 2099204 (Why is no real title available?)
- \texttt{mplrs}: a scalable parallel vertex/facet enumeration code
- Graph algorithms with small communication costs
This page was built for publication: Efficient parallel graph algorithms for coarse-grained multicomputers and BSP
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1601013)
