Planar Orientations with Low Out-Degree and Compaction of Adjacency Matrices (1991)

Cached

Download Links

by Marek Chrobak , David Eppstein
Venue:Theoretical Computer Science
Citations:34 - 3 self

Active Bibliography

17 Graph Augmentation And Related Problems: Theory And Practice – Tsan-Sheng Hsu - 1993
Efficient Parallel And Serial Approximate String Matching – Gad M. Landau, Uzi Vishkin - 1986
2 Fully Dynamic Maintenance of k-Connectivity in Parallel – Weifa Liang, Senior Member, Richard P. Brent, Hong Shen
1 Randomized Parallel Computation – Sanguthevar Rajasekaran, John H. Reif
Subgraph Isomorphism in Planar Graphs and Related Problems – unknown authors - 1999
5 Triangle sparsifiers – Charalampos E. Tsourakakis, Mihail N. Kolountzakis, Gary L. Miller, D. Wagner
113 Subgraph Isomorphism in Planar Graphs and Related Problems – David Eppstein - 1999
14 Implementation of Parallel Graph Algorithms on a Massively Parallel SIMD Computer with Virtual Processing – Tsan-sheng Hsu, Vijaya Ramachandran, Nathaniel Dean - 1995
15 Finding and Counting Small Induced Subgraphs Efficiently – T. Kloks, D. Kratsch, H. Müller
18 The Thickness of Graphs: A Survey – Petra Mutzel, Thomas Odenthal, Mark Scharbrodt - 1998
2 Efficient Algorithms for Path Problems in Weighted Graphs – Virginia Vassilevska - 2008
193 Programming Parallel Algorithms – Guy E. Blelloch - 1996
11 Structural Parallel Algorithmics – Uzi Vishkin - 1991
29 Parallel Algorithmic Techniques for Combinatorial Computation – David Eppstein, Zvi Galil - 1988
3 Data Structures for Two-Edge Connectivity in Planar Graphs – John Hershberger, Monika Rauch, Subhash Suri - 1994
8 Fully Dynamic Algorithms for Edge Connectivity Problems (Extended Abstract) – Zvi Galil, Giuseppe F. Italiano
20 Randomised Techniques in Combinatorial Algorithmics – Michele A. A. Zito - 1999
6 Fully Dynamic Planarity Testing with Applications – Zvi Galil, et al.
4 A linear algorithm for finding a maximal planar subgraph – Hristo N. Djidjev - 2006