Efficient parallel graph algorithms for coarse-grained multicomputers and BSP
From MaRDI portal
Publication:1601013
DOI10.1007/S00453-001-0109-4zbMATH Open0994.68177OpenAlexW2012042319MaRDI QIDQ1601013FDOQ1601013
Authors: Frank Dehne, Afonso G. Ferreira, E. Cáceres, Siang W. Song, Alessandro Roncato 
Publication date: 17 June 2002
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-001-0109-4
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)
- Parallelization strategy for elementary morphological operators on graphs: distance-based algorithms and implementation on multicore shared-memory architecture
- Efficient parallel algorithms for doubly convex-bipartite graphs
- Efficient parallel graph algorithms for coarse grained multicomputers and BSP
- Euro-Par 2004 Parallel Processing
- Title not available (Why is that?)
- \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)
