David Bader, Sukanya Sreshta  Home/Search
Context
Related
| unm.edu/~dbader/pa...lanarity2003.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/~dbader/p...planarity2003 (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: This paper presents a new parallel algorithm for planarity testing based upon the work of Klein and Reif [14]. Our new approach gives correct answers on instances that provoke false positive and false negative results using Klein and Reif's algorithm. The new algorithm has the same complexity bounds as Klein and Reif's algorithm and runs in O n processors of a Concurrent Read Exclusive Write (CREW) Parallel RAM (PRAM). Implementations of the major steps of this parallel algorithm exist ... (Update)
Active bibliography (related documents): More All
0.7: Parallel Algorithmic Techniques for Combinatorial Computation - Eppstein, Galil (1988) (Correct)
0.2: I/O-Optimal Planar Embedding Using Graph Separators - Zeh (Correct)
0.2: Coarse Grained Parallel Graph Planarity Testing - Cáceres, Chan, Dehne, Song (2000) (Correct)
Similar documents based on text: More All
0.4: Evaluating Arithmetic Expressions using Tree.. - Bader, Sreshta.. (2002) (Correct)
0.2: Operating Systems Support for WWW Servers - Suranauwarat, Taniguchi (Correct)
0.2: An Improved Randomized Selection Algorithm With an Experimental.. - Bader (2000) (Correct)
BibTeX entry: (Update)
@misc{ bader-new,
author = "David Bader and Sukanya Sreshta",
title = "A New Parallel Algorithm for Planarity Testing",
url = "citeseer.ist.psu.edu/bader03new.html" }
Citations (may not include all citations):4212 Computers and Intractability -- A Guide to the Theory of NP-.. (context) - Garey, Johnson - 1979
735 A bridging model for parallel computation (context) - Valiant - 1990
375 The LEDA Platform of Combinatorial and Geometric Computing - Mehlhorn, Naher - 1999
135 and graph planarity using PQ-tree algorithms (context) - Booth, Lueker et al. - 1976
71 An algorithm for planarity testing of graphs (context) - Lempel, Even et al. - 1967
34 Theoretical Computer Science (context) - Even, Tarjan et al. - 1976
22 cient planarity testing (context) - Hopcroft, Tarjan - 1974
11 A combinatorial condition for planar graphs (context) - MacLane - 1937
7 AGD--Library: A library of algorithms for graph drawing - Alberts, Gutwenger et al. - 1997
5 Coarse grained parallel graph planarity testing - Caceres, Chan et al. - 2000
5 Using PRAM algorithms on a uniform-memory-access shared-memo.. - Bader, Illendula et al. - 2001
5 Parallel algorithms in graph theory: Planarity testing (context) - JaJa, Simon - 1982
4 cient parallel algorithm for planarity (context) - Klein, Reif - 1986
4 cient parallel algorithm for planarity (context) - Klein, Reif - 1988
4 cient parallel algorithm for planarity (context) - Klein - 1986
1 fast parallel spanning tree algorithm for symmetric multipro.. (context) - Bader, Cong et al. - 2003
1 Fast shared-memory algorithms for computing the minimum span.. (context) - Bader, Cong - 2003
1 Computer and System Sciences (context) - Ramachandran, Reif et al. - 1994
1 Course grained parallel algorithms (context) - Dehne - 1999
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