Parallel Matrix and Graph Algorithms
From MaRDI portal
Publication:3922163
DOI10.1137/0210049zbMath0468.68044OpenAlexW2029342163WikidataQ55954510 ScholiaQ55954510MaRDI QIDQ3922163
Eliezer Dekel, David Nassimi, Sartaj K. Sahni
Publication date: 1981
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0210049
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Algorithms in computer science (68W99)
Related Items
An introduction to parallelism in combinatorial optimization, Correct translation of data parallel assignment onto array processors, Equivalence in the complexity of several problems, Prallel algorithms for analyzing activity networks, Finding maximum matching for bipartite graphs in parallel, An O(n log n log log n) parallel maximum matching algorithm for bipartite graphs, Efficient parallel algorithms for shortest paths in planar graphs, Some parallel algorithms on interval graphs, Fast parallel graph searching with applications, Determining connected components in linear time by a linear number of processors, PARALLEL BLOCK-FINDING USING DISTANCE MATRICES, FINDING CENTERS AND MEDIANS OF GRAPHS IN PARALLEL, Parallel circle-cover algorithms, On efficient parallel computations for some dynamic programming problems, Parallel processing approaches to edge relaxation, Analysis and benchmarking of two parallel sorting algorithms: Hyperquicksort and quickmerge, On the Parallel Evaluation of Dwba Integrals, A local-sparing design methodology for fault-tolerant multiprocessors, Parallel computations on graphs, FluxNet: a physics-informed learning-based Riemann solver for transcritical flows with non-ideal thermodynamics, Sub-cubic cost algorithms for the all pairs shortest path problem, An adaptive parallel algorithm for analyzing activity networks, Parallel algorithms for a depth first search and a breadth first search, single Machine Preemptive Scheduling With Special Cost Functions1, Reducing conflict resolution time for solving graph problems in broadcast communications, Distributed evaluation of an iterative function for all object pairs on an SIMD hypercube, Expected parallel time and sequential space complexity of graph and digraph problems, COMPUTATION OF A DETERMINANT AND A MATRIX PRODUCT IN CELLULAR AUTOMATA, Solving the shortest-paths problem on bipartite permutation graphs efficiently, Efficient parallel algorithms for computing all pair shortest paths in directed graphs, Parallel algorithms on circular-arc graphs, Efficient parallel algorithms for shortest paths in planar digraphs, A new upper bound on the complexity of the all pairs shortest path problem, Embedding grids into hypercubes, Singular value decomposition on SIMD hypercube and shuffle-exchange computers, Computing Hough transforms on hypercube multicomputers, Parallel algorithm for analysing activity networks on a tree-structured computer, Algorithms for some graph problems on a distributed computational model, Communication lower bounds and optimal algorithms for numerical linear algebra, The lexicographically first topological order problem is NLOG-complete, Resilient capacity-aware routing, A parallel approach for determining confidence intervals of variable statistics in large and sparse linear equations with RHS ranges, On the complexity of topological sorting, Decomposing polynomial interpolation for systolic arrays, Exploiting Multiple Levels of Parallelism in Sparse Matrix-Matrix Multiplication, Bipartite Perfect Matching is in Quasi-NC, An adjustable linear time parallel algorithm for maximum weight bipartite matching, Searching for spreads and packings, Graph algorithms on a tree-structured parallel computer, On the complexity of the recognition of parallel 2D-image languages, Computing transitive closure on systolic arrays of fixed size, An efficient deterministic parallel algorithm for two processors precedence constraint scheduling
