Orderly spanning trees with applications to graph encoding and graph drawing

MaRDI QIDQ2768340zbMATH OpenFDO

Authors Yi-Ting Chiang, Ching-Chi Lin, Hsueh-I Lu

Publication date 24 March 2002

zbMATH Keywords

connected planar graphdrawingplanar embeddingspanning tree

Mathematics Subject Classification ID

Trees (05C05) Planar graphs; geometric and topological aspects of graph theory (05C10)

Recommendations

• Orderly Spanning Trees with Applications
• More canonical ordering
• Canonical ordering trees and their applications in graph drawing
• Linear-Time Succinct Encodings of Planar Graphs via Canonical Orderings
• scientific article; zbMATH DE number 1974132

Cited in

(26)

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

Describes a project that uses

Uses Software

• Edgebreaker

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)