Planar orientations with low out-degree and compaction of adjacency matrices
Marek Chrobak
and David Eppstein
Theoretical Computer Science 86(2):243–266, Sep 1991
Mathematical Reviews 93a:68114
http://www.ics.uci.edu/~eppstein/pubs/ChrEpp-TCS-91.pdf
Cited by:
- Efficient massively parallel Euler solver for two-dimensional unstructured grids
- Two-dimensional viscous flow computations on the Connection Machine: unstructured meshes, upwind schemes and massively parallel computations
- Fully dynamic output bounded single source shortest path problem
- Semidynamic algorithms for maintaining single-source shortest path trees
- Fully dynamic shortest paths and negative cycles detection on digraphs with arbitrary arc weights
- Connectivity of planar graphs
- Faster finding of simple cycles in planar graphs on a randomized EREW PRAM
- A simple linear time algorithm for embedding maximal planar graphs
- A note on improving the running time of a class of parallel algorithms using randomization
- Fully dynamic algorithms for maintaining shortest path trees
- What structural features make graph problems to have efficient parallel algorithms? Using outerplanar graphs, trapezoid graphs and in-tournament graphs as examples
- Labeling schemes for flow and connectivity
- Short path queries in planar graphs in constant time
- A new 3-color criterion for planar graphs
- Fully dynamic shortest paths in digraphs with arbitrary arc weights
- Optimal graph orientation with storage applications
- Short cycles in planar graphs
- Small induced-universal graphs and compact implicit graph representations
- Balanced vertex-orderings of graphs
