David A. Bader  Home/Search
Context Related
| unm.edu/papers/AHPCC_TR_99_013.ps.gz 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: unm.edu/papers/99013 (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Graph theoretic techniques are used in variety of important computational problems in the areas of computational physics, mechanics, and fluid flow. We present a new, parallel algorithm for detecting cycles in partitioned, directed graphs that is both scalable in the graph and machine size, and performs well in practice. As an example, on a p = 64 processor cluster, we have solved an extremely large and difficult input problem with n = 2^28 vertices in less than five minutes. Our parallel... (Update)
Context of citations to this paper: More
.... was developed requiring O(log 3 n) time and n=log n processors [11] Another parallel algorithm for planar graphs is due to David Bader [8], but our applications are non planar. In this paper we will describe a recently proposed parallel algorithm due to Fleischer, et al. 2]...
.... O(log 3 n) time and n= log n processors [12] More recently, Bader has an efficient parallel implementation of SCC for planar graphs [3] which uses a clever packed interval representation of the boundary of a planar graph. When n is much larger than p the number of...
Cited by: More
High-Performance Algorithms and Applications for SMP Clusters - Bader (2000) (Correct)
Finding Strongly Connected Components in Parallel.. - McLendon, III.. (2001) (Correct)
Simplified Distributed LTL Model Checking by Localizing Cycles - Lafuente (2002) (Correct)
Similar documents (at the sentence level):
61.9%: A Practical Parallel Algorithm for Cycle Detection in Partitioned.. - Bader (1999) (Correct)
5.7%: An Experimental Comparison of Parallel Algorithms for Ear.. - Bader, Illendula (2000) (Correct)
Active bibliography (related documents): More All
0.2: Broadcast on Clusters of SMPs with Optimal Concurrency - Sun, Bader, Lin (2000) (Correct)
0.1: SIMPLE: A Methodology for Programming High Performance.. - Bader, JaJa (1997) (Correct)
0.1: SIMPLE: A Methodology for Programming High Performance.. - Bader, JaJa (1999) (Correct)
Similar documents based on text: More All
0.3: Design and Analysis of the Alliance / University.. - Bader, Maccabe.. (1999) (Correct)
0.3: An Improved Randomized Selection Algorithm With an Experimental.. - Bader (1999) (Correct)
0.3: An Improved Randomized Selection Algorithm With an Experimental.. - Bader (1999) (Correct)
Related documents from co-citation: More All
5: An improved parallel algorithm that computes the BFS numbering of a directed gra.. (context) - Gazit, Miller - 1988
5: On identifying strongly connected components in parallel - Fleischer, Hendrickson et al. - 2000
5: Introduction to algorithms (context) - Cormen, Leiserson et al. - 1991
BibTeX entry: (Update)
D. A. Bader, A practical parallel algorithm for cycle detection in partitioned digraphs, Tech. Rep. Technical Report AHPCC-TR-99-013, Electrical & Computer Eng. Dept., Univ. New Mexico, Albuquerque, NM, 1999. http://citeseer.ist.psu.edu/bader99practical.html More
@techreport{ bader99practical,
author = "D. Bader",
title = "A practical parallel algorithm for cycle detection in partitioned digraphs",
number = "AHPCC-TR-99-013",
institution = "Electrical \& Computer Eng. Dept., Univ. New Mexico, Albuquerque, NM",
year = "1999",
url = "citeseer.ist.psu.edu/bader99practical.html" }
Citations (may not include all citations):3972 Introduction to Algorithms (context) - Cormen, Leiserson et al. - 1990
735 A Bridging Model for Parallel Computation (context) - Valiant - 1990
531 LogP: Towards a Realistic Model of Parallel Computation - Culler, Karp et al. - 1993
482 Combinatorial Optimization: Algorithms and Complexity (context) - Papadimitriou, Steiglitz - 1998
314 An Introduction to Parallel Algorithms (context) - aJ - 1992
148 Combinatorial Optimization: Networks and Matroids (context) - Lawler - 1976
130 LogGP: Incorporating Long Messages into the LogP Model - One.. - Alexandrov, Ionescu et al. - 1995
47 MeTiS: A Software Package for Partitioning Unstructured Grap.. (context) - Karypis, Kumar - 1998
15 Maximum Matching in a Convex Bipartite Graph (context) - Glover - 1967
12 a Greedy Heuristic for Complete Matching (context) - Reingold, Tarjan - 1981
10 IEEE Transactions on Parallel and Distributed Systems - aJ, Ryu et al. - 1996
7 the Design and Analysis of Practical Parallel Algorithms for.. (context) - Bader - 1996
4 Design and Analysis of the Alliance / University of New Mexi.. - Bader, Maccabe et al. - 1999
The graph only includes citing articles where the year of publication is known.
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