Orderly spanning trees with applications to graph encoding and graph drawing
From MaRDI portal
Publication:2768340
Recommendations
Cited in
(24)- Orderly Spanning Trees with Applications
- Watermelon uniform random generation with applications
- Succinct encoding of binary strings representing triangulations
- AN APPLICATION OF WELL-ORDERLY TREES IN GRAPH DRAWING
- Schnyder woods for higher genus triangulated surfaces, with applications to encoding
- Graph compression and the zeros of polynomials
- A bijection between realizers of maximal plane graphs and pairs of non-crossing Dyck paths
- More canonical ordering
- Succinct representations of planar maps
- Planar graphs, via well-orderly maps and trees
- A compact encoding of plane triangulations with efficient query supports
- scientific article; zbMATH DE number 1974132 (Why is no real title available?)
- Orthogonal drawings based on the stratification of planar graphs
- Optimal \(st\)-orientations for plane triangulations
- Mondshein sequences (a.k.a. (2,1)-orders)
- Leftist canonical ordering
- Visibility representation of plane graphs via canonical ordering tree
- Generating spanning-tree sequences of a fan graph in lexicographic order and ranking/unranking algorithms
- Near-optimal distance emulator for planar graphs
- A Compact Encoding of Plane Triangulations with Efficient Query Supports
- Drawing graphs as spanners
- Sampling and counting 3-orientations of planar triangulations
- Graph Drawing
- Succinct Representation of Labeled Graphs
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)
