Vijaya Ramachandran  Home/Search
Context Related
| utexas.edu/users/vlr/paper...trichap.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: utexas.edu/users/vlr/pub (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: This report deals with a parallel algorithmic technique that has proved to be very useful in the design of efficient parallel algorithms for several problems on undirected graphs. We describe this method for searching undirected graphs, called "open ear decomposition", and we relate this decomposition to graph biconnectivity. We present an efficient parallel algorithm for finding this decomposition and we relate it to a sequential algorithm based on depth-first search. We then apply open... (Update)
Cited by: More
DOI: 10.1007/s00453-001-0109-4 - Algorithmica Algorithmica.. (Correct)
EfficientParallel Graph Algorithms For Coarse - Grained Multicomputers And (Correct)
Efficient Parallel Graph Algorithms for Coarse-Grained .. - Dehne, Ferreira.. (2002) (Correct)
Active bibliography (related documents): More All
0.9: Finding Triconnected Components By Local Replacement - Fussell, RAMACHANDRAN.. (1993) (Correct)
0.5: Structural Parallel Algorithmics - Vishkin (1991) (Correct)
0.4: Decomposition Characterizations of Classes of 2-Connected Graphs - Pootheri (Correct)
Similar documents based on text: More All
0.9: Parallel Ear Decomposition Search (EDS) And ST-Numbering In .. - Maon, Schieber, Vishkin (1986) (Correct)
0.8: Parallel Implementation of Algorithms for Finding.. - Hsu, Ramachandran, Dean (1997) (Correct)
0.7: Improving on the 1.5-Approximation of a Smallest 2-Edge.. - Cheriyan Sebo Szigeti (Correct)
Related documents from co-citation: More All
20: An efficient parallel biconnectivity algorithm (context) - Tarjan, Vishkin - 1985
18: Parallel merge sort (context) - Cole - 1988
17: Synthesis of Parallel Algorithms (context) - Reif - 1993
BibTeX entry: (Update)
V. Ramachandran. "Parallel open ear decomposition with applications to graph biconnectivity and triconnectivity", in [28], pp. 276 - 340. http://citeseer.ist.psu.edu/ramachandran92parallel.html More
@incollection{ ramachandran93parallel,
author = "Ramachandran",
title = "Parallel Open Ear Decomposition with Applications to Graph Biconnectivity and Triconnectivity",
booktitle = "John H. Reif (Ed.), Synthesis of Parallel Algorithms, Morgan Kaufmann",
year = "1993",
url = "citeseer.ist.psu.edu/ramachandran92parallel.html" }
Citations (may not include all citations):405 Depth first search and linear graph algorithms (context) - Tarjan - 1972
268 Parallel algorithms for shared memory machines (context) - Karp, Ramachandran - 1990
258 Data Structures and Network Algorithms (context) - Tarjan - 1983
227 Parallel merge sort (context) - Cole - 1988
209 Computer Science Press (context) - Even, Algorithms - 1979
95 On finding lowest common ancestors: simplification and paral.. (context) - Schieber, Vishkin - 1988
77 Dividing a graph into triconnected components (context) - Hopcroft, Tarjan - 1973
77 An efficient parallel biconnectivity algorithm (context) - Tarjan, Vishkin - 1984
45 Optimal and sublogarithmic time randomized parallel sorting .. - Rajasekharan, Reif - 1989
44 Optimal parallel evaluation of tree-structured computations .. (context) - Kosaraju, Delcher - 1988
34 Non-separable and planar graphs (context) - Whitney - 1932
28 An optimal randomized parallel algorithm for finding connect.. (context) - Gazit - 1986
28 University of Toronto Press (context) - Tutte, Graphs - 1966
20 Towards optimal parallel bucket sorting (context) - Hagerup - 1987
18 Improved algorithms for graph fourconnectivity (context) - Kanevsky, Ramachandran - 1991
18 A combinatorial representation for polyhedral surfaces (context) - Edmonds - 1960
18 Efficient parallel ear decomposition with applications (context) - Miller, Ramachandran - 1986
17 A new graph triconnectivity algorithm and its parallelizatio.. (context) - Miller, Ramachandran - 1987
15 Finding triconnected components by local replacements - Fussell, Ramachandran et al. - 1989
13 Planarity testing in parallel (context) - Ramachandran, Reif
11 Parallel ear decomposition search (EDS) and st-numbering in .. - Maon, Schieber et al. - 1986
9 Design and Analysis of Some Parallel Algorithms (context) - Schieber - 1987
7 Efficient parallel triconnectivity in logarithmic time (context) - Ramachandran, Vishkin - 1988
3 Finding the triconnected components of a graph (context) - Hopcroft, Tarjan - 1972
1 Approximate and exact parallel techniques with applications .. (context) - Cole, Vishkin - 1986
1 Computing ears and branchings in parallel (context) - Lovasz - 1985
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.utexas.edu/users/vlr/pub.html): More
ERCW PRAMs and Optical Communication - MacKenzie, Ramachandran (1997) (Correct)
An Optimal EREW PRAM Algorithm For Minimum Spanning.. - King, Poon.. (1997) (Correct)
The Queue-Read Queue-Write PRAM Model: Accounting for.. - Gibbons, Matias (1994) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC