Pages that link to "Item:Q1601013"
From MaRDI portal
The following pages link to Efficient parallel graph algorithms for coarse-grained multicomputers and BSP (Q1601013):
Displaying 12 items.
- A bridging model for multi-core computing (Q619912) (← links)
- Efficient parallel algorithms for doubly convex-bipartite graphs (Q672468) (← links)
- Efficient graph-theoretic algorithms on a linear array with a reconfigurable pipelined bus system (Q698145) (← links)
- Emulations between QSM, BSP and LogP: A framework for general-purpose parallel algorithm design. (Q1426213) (← links)
- Graph algorithms with small communication costs (Q1587586) (← links)
- \texttt{mplrs}: a scalable parallel vertex/facet enumeration code (Q1621690) (← links)
- Parallelization strategy for elementary morphological operators on graphs: distance-based algorithms and implementation on multicore shared-memory architecture (Q2403751) (← links)
- Communication in parallel systems : Models, algorithms and implementations (Q2763056) (← links)
- Parallel Algorithms for Maximal Cliques in Circle Graphs and Unrestricted Depth Search (Q3060200) (← links)
- Successive approximation in parallel graph algorithms (Q5096155) (← links)
- Euro-Par 2004 Parallel Processing (Q5311351) (← links)
- Communication efficient BSP algorithm for all nearest smaller values problem (Q5959182) (← links)
