Orderly Spanning Trees with Applications to Graph Encoding and Graph Drawing (2001)

Cached

Download Links

by Yi-ting Chiang , Ching-Chi Lin , Hsueh-i Lu
Venue:In 12 th Symposium on Discrete Algorithms (SODA
Citations:33 - 6 self

Documents Related by Co-Citation

47 Compact Encodings of Planar Graphs via Canonical Orderings and Multiple Parentheses – Richie Chih-nan Chuang, Ashim Garg, Xin He, Ming-Yang Kao, Hsueh-i Lu - 1998
140 Succinct Representation of Balanced Parentheses, Static Trees and Planar Graphs – J. Ian Munro, Venkatesh Raman - 1999
197 Embedding planar graphs on the grid – W Schnyder - 1990
170 Space-efficient static trees and graphs – G JACOBSON - 1989
263 Edgebreaker: Connectivity compression for triangle meshes – Jarek Rossignac - 1999
77 On the succinct representation of graphs – G Turán - 1984
41 Short Encodings of Planar Graphs and Maps – Kenneth Keeler, Jeffery Westbrook - 1993
30 Compact Routing Tables for Graphs of Bounded Genus – Cyril Gavoille, Nicolas Hanusse - 2000
37 Optimal Coding and Sampling of Triangulations – Dominique Poulalhon, Gilles Schaeffer - 2003
23 A Fast General Methodology For Information-Theoretically Optimal Encodings Of Graphs – Xin He, Ming-yang Kao, Hsueh-I Lu - 1999
52 Near-Optimal Connectivity Encoding of 2-Manifold Polygon Meshes – Andrei Khodakovsky, Pierre Alliez, Mathieu Desbrun, Peter Schröder - 2002
112 A census of planar triangulations – W T Tutte - 1962
53 Planar graphs and poset dimension – W Schnyder - 1989
13 Succinct representation of triangulations with a boundary. WADS – L. Castelli Aleardi, Olivier Devillers, Gilles Schaeffer - 2005
25 Drawing planar graphs using the canonical ordering, Algorithmica – Special Issue on Graph Drawing 16 – G Kant - 1996
60 How to Draw a Planar Graph on a Grid. Combinatorica – H de Fraysseix, J Pach, R Pollack - 1990
21 Linear-time succinct encodings of planar graphs via canonical orderings – Xin He, Ming-yang Kao, Hsueh-i Lu - 1999
67 Drawing Planar Graphs Using the Canonical Ordering – Goos Kant - 1996
22 An Information-Theoretic Upper Bound on Planar Graphs Using Well-Orderly Maps – Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse - 2011