scientific article; zbMATH DE number 3905859
zbMATH Open0567.68040MaRDI QIDQ3683547FDOQ3683547
Authors: Michael J. Quinn, Narsingh Deo 
Publication date: 1984
Title of this publication is not available (Why is that?)
Recommendations
surveyminimum spanning treemaximum cliqueparallel computationshortest pathparallel algorithmsbibliographyconnected componentstraveling salesmansearchingmaximum cardinality matchingsystolic arraysarray processorsSIMD machinesassociative processorsmultiple CPU computers
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) Extremal problems in graph theory (05C35) Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Algorithms in computer science (68W99)
Cited In (44)
- A canonical form of vector machines
- Parallel algorithms for connectivity problems in graph theory
- Parallel heap: an optimal parallel priority queue
- Title not available (Why is that?)
- A linear systolic algorithm for the connected component problem
- An \(O(\log m)\) parallel algorithm for the minimum spanning tree problem
- Representation of Edmonds' algorithm for finding optimum graph branching on associative parallel processors
- Efficient parallel algorithms for graph problems
- Parallel circle-cover algorithms
- Parallel algorithms for shortest path problems in polygons
- Parallel consistent labeling algorithms
- Fast parallel graph searching with applications
- Title not available (Why is that?)
- Title not available (Why is that?)
- Parallel Algorithm for Conflict Graph on OTIS-Triangular Array
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Parallel algorithms for series parallel graphs
- Parallel algorithms on circular-arc graphs
- A survey of constrained classification
- Parallel computations on a graph
- Title not available (Why is that?)
- Computation of shortest path in cellular automata
- Title not available (Why is that?)
- Some parallel algorithms on interval graphs
- Computing minimum spanning forests on 1- and 2-dimensional processor arrays (extended abstract)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Optimal vertex ordering of graphs
- An efficient parallel algorithm for the all pairs shortest path problem
- Finding Euler tours in parallel
- High Parallel Complexity Graphs and Memory-Hard Functions
- Efficient parallel algorithms for permutation graphs
- On parallel complexity of the subgraph homeomorphism of the subgraph isomorphism problem for classes of planar graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- An adaptive and cost-optimal parallel algorithm for minimum spanning trees
- An efficient algorithm for concurrent priority queue heaps
- Graph-theoretical properties of parallelism in the digital plane
- Title not available (Why is that?)
- Parallel computations on graphs
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)
