scientific article; zbMATH DE number 3905859
array processorsassociative processorsbibliographyconnected componentsmaximum cardinality matchingmaximum cliqueminimum spanning treemultiple CPU computersparallel algorithmsparallel computationsearchingshortest pathSIMD machinessurveysystolic arraystraveling salesman
Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Extremal problems in graph theory (05C35) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Algorithms in computer science (68W99)
- An adaptive and cost-optimal parallel algorithm for minimum spanning trees
- Some parallel algorithms on interval graphs
- Fast parallel graph searching with applications
- Parallel algorithms for shortest path problems in polygons
- Parallel consistent labeling algorithms
- Parallel circle-cover algorithms
- A linear systolic algorithm for the connected component problem
- An \(O(\log m)\) parallel algorithm for the minimum spanning tree problem
- On parallel complexity of the subgraph homeomorphism of the subgraph isomorphism problem for classes of planar graphs
- Efficient parallel algorithms for graph problems
- An efficient algorithm for concurrent priority queue heaps
- A survey of constrained classification
- A canonical form of vector machines
- Representation of Edmonds' algorithm for finding optimum graph branching on associative parallel processors
- Optimal vertex ordering of graphs
- Graph-theoretical properties of parallelism in the digital plane
- Efficient parallel algorithms for permutation graphs
- Computation of shortest path in cellular automata
- High Parallel Complexity Graphs and Memory-Hard Functions
- Parallel computations on a graph
- scientific article; zbMATH DE number 4131653 (Why is no real title available?)
- scientific article; zbMATH DE number 2089184 (Why is no real title available?)
- Graphs and algorithms
- Parallel computations on graphs
- scientific article; zbMATH DE number 3850854 (Why is no real title available?)
- scientific article; zbMATH DE number 3874588 (Why is no real title available?)
- scientific article; zbMATH DE number 4147533 (Why is no real title available?)
- scientific article; zbMATH DE number 3930349 (Why is no real title available?)
- scientific article; zbMATH DE number 3972201 (Why is no real title available?)
- scientific article; zbMATH DE number 4035123 (Why is no real title available?)
- scientific article; zbMATH DE number 4037239 (Why is no real title available?)
- scientific article; zbMATH DE number 4039280 (Why is no real title available?)
- scientific article; zbMATH DE number 4068310 (Why is no real title available?)
- Parallel algorithms for connectivity problems in graph theory
- scientific article; zbMATH DE number 4128411 (Why is no real title available?)
- scientific article; zbMATH DE number 500370 (Why is no real title available?)
- scientific article; zbMATH DE number 1102788 (Why is no real title available?)
- scientific article; zbMATH DE number 1151367 (Why is no real title available?)
- scientific article; zbMATH DE number 1163093 (Why is no real title available?)
- scientific article; zbMATH DE number 1985710 (Why is no real title available?)
- Parallel algorithms for series parallel graphs
- Computing minimum spanning forests on 1- and 2-dimensional processor arrays (extended abstract)
- Parallel Algorithm for Conflict Graph on OTIS-Triangular Array
- Parallel algorithms on circular-arc graphs
- An efficient parallel algorithm for the all pairs shortest path problem
- Finding Euler tours in parallel
- Parallel heap: an optimal parallel priority queue
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3683547)
