Journal ArticleDOI
Finding fundamental cycles and bridges on a tree-structured parallel computer
Reads0
Chats0
TLDR
The machine model that is concerned with is a tree-structured parallel computer which combines SIMD and systolic computers in a treelike manner and has an O(n2dp + n log p)-time algorithm for finding fundamental cycles and bridges in a connected, undirected graph G with n vertices.About:
This article is published in Information Sciences.The article was published on 1986-11-01. It has received 6 citations till now. The article focuses on the topics: Spanning tree & Tree (graph theory).read more
Citations
More filters
Journal ArticleDOI
Parallel graph algorithms for hypercube computers
TL;DR: Except for the bridge-finding algorithm, all others achieve optimal speedups for dense as well as sparse graphs, and each algorithm is optimally scalable up to a large number of processors depending upon the density of the input graph.
Journal ArticleDOI
Notes on 'divide-and-conquer-based optimal parallel algorithms for some graph problems on EREW PRAM model'
Sajal K. Das,Narsingh Deo +1 more
TL;DR: Using an exclusive-read and exclusive-write (EREW) parallel random-access memory (PRAM) model with a fixed number of processors, optimal parallel algorithms are presented for several problems on undirected graphs, achieving optimal speedup for dense as well as sparse graphs.
Journal ArticleDOI
Top-k Manhattan Spatial Skyline Queries
TL;DR: The retrieval of relevant points with respect to a query and a scoring function: let P and Q be point sets in the plane, the skyline of P with respectto Q consists of points P for which no other point of P is closer to all points of Q.
Journal ArticleDOI
Stirling networks: a versatile combinatorial topology for multiprocessor systems
TL;DR: A routing scheme that is deadlock free, avoids congestions, and can be executed on the fly by bit manipulation of node labels is presented, and several classes of parallel algorithms can be efficiently implemented using these networks.
Journal ArticleDOI
Group nearest-neighbor queries in the L 1 plane
TL;DR: This paper addresses a generalization of the k-NN query problem to a query set Q of points, namely, the group k-nearest-neighbor query problem, in the L 1 plane, and proposes two algorithms, one based on the range tree and the other based on a data structure for segment dragging queries.
References
More filters
Journal ArticleDOI
Efficient parallel algorithms for some graph problems
TL;DR: A general time bound is derived for a parallel algorithm that uses K processors for finding the connected components of an undirected graph and the result is optimal in the sense that the speedup ratio is linear with the number of processors used.
Book ChapterDOI
The Structure of Parallel Algorithms.
TL;DR: This chapter deals with the basic issues and techniques in designing parallel algorithms for various architectures and concludes that issues concerning algorithms for synchronous parallel computers are quite different from those for asynchronous parallel computers.
Journal ArticleDOI
Fast, Efficient Parallel Algorithms for Some Graph Problems
Carla D. Savage,Joseph JaJa +1 more
TL;DR: In the algorithms for finding minimum spanning trees, bridges, and fundamental cycles, the number of processors used is small enough that the parallel algorithm is efficient in comparison with the best sequential algorithms for these problems.
Journal ArticleDOI
A parallel algorithm for constructing minimum spanning trees
TL;DR: A new parallel algorithm is studied that constructs an MST of an N-node graph in time proportional to N lg N, on an N(lg N)-processor computing system.