Finding Biconnected Components and Computing Tree Functions in Logarithmic Parallel Time (Extended Summary) (original) (raw)
Related papers
Graph algorithms on a tree-structured parallel computer
BIT, 1984
Tree-based graph algorithms for some parallel computers
An O(logn) parallel connectivity algorithm
Journal of Algorithms, 1982
Efficient Parallel Algorithms for a Class of Graph Theoretic Problems
SIAM Journal on Computing, 1984
Better speedups using simpler parallel programming for graph connectivity and biconnectivity
2012
Parallel algorithm for concurrent computation of connected component tree
Eva DOKLADALOVA, Eva Dokladalova, Thierry Grandpierre, Laurent Najman
Advanced Concepts for …, 2008
A coarse-grained parallel algorithm for spanning tree and connected components
2004
A new parallel algorithm for connected components in dynamic graphs
20th Annual International Conference on High Performance Computing, 2013
DSP-CC: I/O Efficient Parallel Computation of Connected Components in Billion-scale Networks
IEEE Transactions on Knowledge and Data Engineering, 2015
A simple parallel tree contraction algorithm
Journal of Algorithms, 1989
A parallel algorithm for computing minimum spanning trees
Proceedings of the fourth annual ACM …, 1992
Efficient Bulk Operations on Dynamic R-Trees
Algorithmica, 2002
Improved Parallel Implementations of Gusfield's Cut Tree Algorithm
2011 Simpasio em Sistemas Computacionais, 2011
Efficient implementation of tree skeletons on distributed-memory parallel computers
2006
On the architectural requirements for efficient execution of graph algorithms
Efficient Parallel Graph Algorithms for Coarse-Grained Multicomputers and BSP
Algorithmica, 2002
A parallel implementation of Gomory-Hu's cut tree algorithm
2012
Parallel Tree Contraction Part 2: Further Applications
SIAM Journal on Computing, 1991
A divide-and-conquer algorithm for identifying strongly connectedcomponents
2003
Parallel algorithms for treewidth two
Lecture Notes in Computer Science, 1997
A parallel algorithm for bisection width in trees
Computers & Mathematics with Applications, 1988
Efficient parallel algorithms for graph problems
Algorithmica, 1990
A simple and practical linear-work parallel algorithm for connectivity
Proceedings of the 26th ACM symposium on Parallelism in algorithms and architectures, 2014
Techniques for Designing Efficient Parallel Graph Algorithms for SMPs and Multicore Processors
Large Graph Algorithms for Massively Multithreaded Architectures
2009
R-Tree: A Hardware Implementation
A Parallel Algorithm for Constructing Minimum Spanning Trees
Journal of Algorithms, 1980
Parallel algorithms for graph problems
Dartmouth College, Hanover, NH, 1992
Biconnectivity, chain decomposition and ststst-numbering using O(n)O(n)O(n) bits
ArXiv, 2016