Pages that link to "Item:Q3922163"
From MaRDI portal
The following pages link to Parallel Matrix and Graph Algorithms (Q3922163):
Displaying 50 items.
- Computing Hough transforms on hypercube multicomputers (Q547488) (← links)
- Algorithms for some graph problems on a distributed computational model (Q580985) (← links)
- The lexicographically first topological order problem is NLOG-complete (Q582104) (← links)
- Solving the shortest-paths problem on bipartite permutation graphs efficiently (Q672656) (← links)
- Efficient parallel algorithms for computing all pair shortest paths in directed graphs (Q676269) (← links)
- On the complexity of topological sorting (Q750150) (← links)
- Graph algorithms on a tree-structured parallel computer (Q797290) (← links)
- On the complexity of the recognition of parallel 2D-image languages (Q808271) (← links)
- Computing transitive closure on systolic arrays of fixed size (Q808290) (← links)
- An adaptive parallel algorithm for analyzing activity networks (Q910339) (← links)
- An adjustable linear time parallel algorithm for maximum weight bipartite matching (Q1045931) (← links)
- An introduction to parallelism in combinatorial optimization (Q1076605) (← links)
- Prallel algorithms for analyzing activity networks (Q1090459) (← links)
- An O(n log n log log n) parallel maximum matching algorithm for bipartite graphs (Q1091829) (← links)
- Some parallel algorithms on interval graphs (Q1098312) (← links)
- Fast parallel graph searching with applications (Q1103409) (← links)
- Determining connected components in linear time by a linear number of processors (Q1108033) (← links)
- Parallel circle-cover algorithms (Q1108792) (← links)
- On efficient parallel computations for some dynamic programming problems (Q1109691) (← links)
- Parallel processing approaches to edge relaxation (Q1114433) (← links)
- Analysis and benchmarking of two parallel sorting algorithms: Hyperquicksort and quickmerge (Q1123621) (← links)
- Reducing conflict resolution time for solving graph problems in broadcast communications (Q1183491) (← links)
- Distributed evaluation of an iterative function for all object pairs on an SIMD hypercube (Q1183505) (← links)
- Expected parallel time and sequential space complexity of graph and digraph problems (Q1186789) (← links)
- Efficient parallel algorithms for shortest paths in planar digraphs (Q1196454) (← links)
- A new upper bound on the complexity of the all pairs shortest path problem (Q1199881) (← links)
- Embedding grids into hypercubes (Q1201880) (← links)
- Singular value decomposition on SIMD hypercube and shuffle-exchange computers (Q1205900) (← links)
- Correct translation of data parallel assignment onto array processors (Q1336950) (← links)
- Finding maximum matching for bipartite graphs in parallel (Q1342094) (← links)
- A local-sparing design methodology for fault-tolerant multiprocessors (Q1388972) (← links)
- An efficient deterministic parallel algorithm for two processors precedence constraint scheduling (Q1870558) (← links)
- Resilient capacity-aware routing (Q2044217) (← links)
- Searching for spreads and packings (Q2573120) (← links)
- Exploiting Multiple Levels of Parallelism in Sparse Matrix-Matrix Multiplication (Q2833530) (← links)
- Parallel computations on graphs (Q3221400) (← links)
- Parallel algorithm for analysing activity networks on a tree-structured computer (Q3352502) (← links)
- A parallel approach for determining confidence intervals of variable statistics in large and sparse linear equations with RHS ranges (Q3630039) (← links)
- Equivalence in the complexity of several problems (Q3711747) (← links)
- Parallel algorithms for a depth first search and a breadth first search (Q3802639) (← links)
- Communication lower bounds and optimal algorithms for numerical linear algebra (Q4683913) (← links)
- Decomposing polynomial interpolation for systolic arrays (Q4713422) (← links)
- PARALLEL BLOCK-FINDING USING DISTANCE MATRICES (Q4820161) (← links)
- FINDING CENTERS AND MEDIANS OF GRAPHS IN PARALLEL (Q4820169) (← links)
- On the Parallel Evaluation of Dwba Integrals (Q4844588) (← links)
- single Machine Preemptive Scheduling With Special Cost Functions<sup>1</sup> (Q4888275) (← links)
- Bipartite Perfect Matching is in Quasi-NC (Q4997314) (← links)
- Efficient parallel algorithms for shortest paths in planar graphs (Q5056111) (← links)
- COMPUTATION OF A DETERMINANT AND A MATRIX PRODUCT IN CELLULAR AUTOMATA (Q5151295) (← links)
- Parallel algorithms on circular-arc graphs (Q5899761) (← links)
