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

Documents Related by Co-Citation

72 Arboricity and subgraph listing algorithms – N Chiba, T Nishizeki
10988 Computers and Intractability: A Guide to the Theory of NP-completeness – M Garey, D Johnson - 1979
1402 Network Flows: Theory, Algorithms, and Applications – R K Ahuja, T L Magnanti, J B Orlin - 1993
83 Ambivalent Data Structures For Dynamic 2-Edge-Connectivity And k Smallest Spanning Trees – Greg N. Frederickson - 1991
342 Graph Algorithms – S Even - 1979
205 Embedding planar graphs on the grid – W Schnyder - 1990
61 Edge-disjoint spanning trees of finite graphs – C St J A Nash-Williams - 1961
13 A Linear-Time Algorithm For Testing The Inscribability Of Trivalent Polyhedra – Michael B. Dillencourt, Warren D. Smith - 1995
22 The clique problem for planar graphs – M Yannakakis - 1981
113 Subgraph Isomorphism in Planar Graphs and Related Problems – David Eppstein - 1999
8 Dynamic Representations of Sparse Graphs – Gerth Stølting Brodal, Rolf Fagerberg - 1999
397 A Separator Theorem for Planar Graphs f – Richard J. Lipton, Robert E. Tarjan - 1977
17 A new method for drawing a planar graph given the cyclic order of the edges at each vertex – R Read - 1987
48 I.: Algorithms for drawing graphs: an annotated bibliography – G D Battista, P Eades, R Tamassia, Tollis - 1994
45 Updating distances in dynamic graphs – S Even, H Gazit - 1985
824 A note on two problems in connection with graphs – E W Dijkstra - 1959
180 Mesh Generation And Optimal Triangulation – Marshall Bern, David Eppstein - 1992
6 Computing the Girth of a Planar Graph – Hristo N. Djidjev - 2000
473 Testing for the consecutive ones property, interval graphs and graph planarity using PQ-tree algorithms – K Booth, G Lueker - 1976