Pages that link to "Item:Q2768340"

The following pages link to Orderly spanning trees with applications to graph encoding and graph drawing (Q2768340):

Displaying 20 items.

• A compact encoding of plane triangulations with efficient query supports (Q407553) (← links)
• Schnyder woods for higher genus triangulated surfaces, with applications to encoding (Q834610) (← links)
• Graph compression and the zeros of polynomials (Q834888) (← links)
• Succinct representations of planar maps (Q959810) (← links)
• Optimal \(st\)-orientations for plane triangulations (Q1029266) (← links)
• Visibility representation of plane graphs via canonical ordering tree (Q1044700) (← links)
• Orthogonal drawings based on the stratification of planar graphs (Q1422412) (← links)
• Watermelon uniform random generation with applications (Q1885015) (← links)
• Planar graphs, via well-orderly maps and trees (Q2502033) (← links)
• A bijection between realizers of maximal plane graphs and pairs of non-crossing Dyck paths (Q2566278) (← links)
• Succinct encoding of binary strings representing triangulations (Q2665909) (← links)
• Sampling and counting 3-orientations of planar triangulations (Q2804991) (← links)
• Mondshein sequences (a.k.a. (2,1)-orders) (Q2832896) (← links)
• More Canonical Ordering (Q3168834) (← links)
• (Q5009573) (← links)
• Succinct Representation of Labeled Graphs (Q5387767) (← links)
• A Compact Encoding of Plane Triangulations with Efficient Query Supports (Q5452159) (← links)
• Graph Drawing (Q5897653) (← links)
• Drawing graphs as spanners (Q5918794) (← links)
• Generating spanning-tree sequences of a fan graph in lexicographic order and ranking/unranking algorithms (Q6111508) (← links)