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:33 - 4 self

Documents Related by Co-Citation

69 Arboricity and subgraph listing algorithms – N Chiba, T Nishizeki - 1985
10870 Computers and Intractability: A Guide to the Theory of NP-Completeness – M R Garey, D S Johnson - 1979
1394 Network flows: theory, algorithms, and applications – R Ahuja, T Magnanti, J Orlin - 1993
80 Ambivalent Data Structures For Dynamic 2-Edge-Connectivity And k Smallest Spanning Trees – Greg N. Frederickson - 1991
61 Edge-disjoint spanning trees of finite graphs – C St J A Nash-Williams - 1961
12 A Linear-Time Algorithm For Testing The Inscribability Of Trivalent Polyhedra – Michael B. Dillencourt, Warren D. Smith - 1995
20 The clique problem for planar graphs – C H Papadimitriou, M Yannakakis
108 Subgraph Isomorphism in Planar Graphs and Related Problems – David Eppstein - 1999
8 Dynamic Representations of Sparse Graphs – Gerth Stølting Brodal, Rolf Fagerberg - 1999
386 A Separator Theorem for Planar Graphs – Richard J. Lipton, Robert E. Tarjan - 1977
44 Updating Distances in Dynamic Graphs – S Even, H Gazit - 1985
819 A note on two problems in connection with graphs – E W Dijkstra - 1959
179 Mesh Generation And Optimal Triangulation – Marshall Bern, David Eppstein - 1992
5 Computing the Girth of a Planar Graph – Hristo N. Djidjev - 2000
93 Network Flow and Testing Graph Connectivity – S Even, R E Tarjan - 1975
124 A fast parametric maximum flow algorithm and applications – G Gallo, M D Grigoriadis, R E Tarjan - 1989
196 Embedding Planar Graphs in the Grid – W Schnyder - 1990
159 Almost optimal set covers in finite VC-dimension – Herve Brönnimann, Michael T. Goodrich
161 Lectures in Discrete Geometry – Jirí Matousek - 2002