Pages that link to "Item:Q5317182"
From MaRDI portal
The following pages link to Orderly Spanning Trees with Applications (Q5317182):
Displaying 22 items.
- A compact encoding of plane triangulations with efficient query supports (Q407553) (← links)
- Ultra-succinct representation of ordered trees with applications (Q414928) (← links)
- Succinct representation of labeled trees (Q476876) (← links)
- Simple and efficient fully-functional succinct trees (Q507389) (← links)
- I/O-efficient path traversal in succinct planar graphs (Q521807) (← links)
- Good spanning trees in graph drawing (Q897943) (← links)
- Schnyder woods and orthogonal surfaces (Q946686) (← links)
- Monotone drawings of \(k\)-inner planar graphs (Q1725768) (← links)
- A transformation algorithm to construct a rectangular floorplan (Q2031052) (← links)
- Navigating planar topologies in near-optimal space and time (Q2096370) (← links)
- Drawing planar graphs with few segments on a polynomial grid (Q2206874) (← links)
- Linear-time algorithms for tree root problems (Q2346968) (← links)
- Succinct representation of labeled graphs (Q2428673) (← links)
- Fully Functional Static and Dynamic Succinct Trees (Q2799480) (← links)
- Mondshein Sequences (a.k.a. (2,1)-Orders) (Q2832896) (← links)
- BOUNDING THE NUMBER OF REDUCED TREES, COGRAPHS, AND SERIES-PARALLEL GRAPHS BY COMPRESSION (Q2846474) (← links)
- Succinct Representations of Ordinal Trees (Q2848982) (← links)
- Complexity Measures for Mosaic Drawings (Q2980906) (← links)
- Recent Developments in Floorplan Representations (Q5135264) (← links)
- A Compact Encoding of Plane Triangulations with Efficient Query Supports (Q5452159) (← links)
- Fast and compact planar embeddings (Q5918983) (← links)
- (Q6065424) (← links)
