Orderly spanning trees with applications to graph encoding and graph drawing
From MaRDI portal
Publication:2768340
zbMATH Open0988.05029MaRDI QIDQ2768340FDOQ2768340
Authors: Yi-Ting Chiang, Ching-Chi Lin, Hsueh-I Lu 
Publication date: 24 March 2002
Recommendations
Cited In (23)
- A bijection between realizers of maximal plane graphs and pairs of non-crossing Dyck paths
- AN APPLICATION OF WELL-ORDERLY TREES IN GRAPH DRAWING
- Graph compression and the zeros of polynomials
- Orderly Spanning Trees with Applications
- Schnyder woods for higher genus triangulated surfaces, with applications to encoding
- A compact encoding of plane triangulations with efficient query supports
- A Compact Encoding of Plane Triangulations with Efficient Query Supports
- More canonical ordering
- Title not available (Why is that?)
- Succinct representations of planar maps
- Orthogonal drawings based on the stratification of planar graphs
- Leftist canonical ordering
- Graph Drawing
- Drawing graphs as spanners
- Optimal \(st\)-orientations for plane triangulations
- Visibility representation of plane graphs via canonical ordering tree
- Planar graphs, via well-orderly maps and trees
- Succinct encoding of binary strings representing triangulations
- Watermelon uniform random generation with applications
- Generating spanning-tree sequences of a fan graph in lexicographic order and ranking/unranking algorithms
- Succinct Representation of Labeled Graphs
- Sampling and counting 3-orientations of planar triangulations
- Title not available (Why is that?)
Uses Software
This page was built for publication: Orderly spanning trees with applications to graph encoding and graph drawing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2768340)
