Parallel Matrix and Graph Algorithms
From MaRDI portal
Cited in
(52)- A local-sparing design methodology for fault-tolerant multiprocessors
- Exploiting multiple levels of parallelism in sparse matrix-matrix multiplication
- A parallel approach for determining confidence intervals of variable statistics in large and sparse linear equations with RHS ranges
- Parallel circle-cover algorithms
- Equivalence in the complexity of several problems
- Computing Hough transforms on hypercube multicomputers
- Determining connected components in linear time by a linear number of processors
- Fast parallel graph searching with applications
- Efficient parallel algorithms for shortest paths in planar digraphs
- Parallel processing approaches to edge relaxation
- Analysis and benchmarking of two parallel sorting algorithms: Hyperquicksort and quickmerge
- FINDING CENTERS AND MEDIANS OF GRAPHS IN PARALLEL
- PARALLEL BLOCK-FINDING USING DISTANCE MATRICES
- Parallel algorithms on circular-arc graphs
- Computation of a determinant and a matrix product in cellular automata
- The lexicographically first topological order problem is NLOG-complete
- On the Parallel Evaluation of Dwba Integrals
- Solving the shortest-paths problem on bipartite permutation graphs efficiently
- Some parallel algorithms on interval graphs
- On the complexity of topological sorting
- On efficient parallel computations for some dynamic programming problems
- Bipartite perfect matching is in quasi-NC
- Resilient capacity-aware routing
- Parallel algorithm for analysing activity networks on a tree-structured computer
- Embedding grids into hypercubes
- An efficient deterministic parallel algorithm for two processors precedence constraint scheduling
- An introduction to parallelism in combinatorial optimization
- Correct translation of data parallel assignment onto array processors
- single Machine Preemptive Scheduling With Special Cost Functions1
- Distributed evaluation of an iterative function for all object pairs on an SIMD hypercube
- Reducing conflict resolution time for solving graph problems in broadcast communications
- An adaptive parallel algorithm for analyzing activity networks
- Decomposing polynomial interpolation for systolic arrays
- Finding maximum matching for bipartite graphs in parallel
- An adjustable linear time parallel algorithm for maximum weight bipartite matching
- Communication lower bounds and optimal algorithms for numerical linear algebra
- Prallel algorithms for analyzing activity networks
- An O(n log n log log n) parallel maximum matching algorithm for bipartite graphs
- Parallel algorithms for a depth first search and a breadth first search
- FluxNet: a physics-informed learning-based Riemann solver for transcritical flows with non-ideal thermodynamics
- Expected parallel time and sequential space complexity of graph and digraph problems
- Graph algorithms on a tree-structured parallel computer
- Singular value decomposition on SIMD hypercube and shuffle-exchange computers
- A new upper bound on the complexity of the all pairs shortest path problem
- Computing transitive closure on systolic arrays of fixed size
- On the complexity of the recognition of parallel 2D-image languages
- Parallel computations on graphs
- Algorithms for some graph problems on a distributed computational model
- Efficient parallel algorithms for shortest paths in planar graphs
- Sub-cubic cost algorithms for the all pairs shortest path problem
- Efficient parallel algorithms for computing all pair shortest paths in directed graphs
- Searching for spreads and packings
This page was built for publication: Parallel Matrix and Graph Algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3922163)
