Pages that link to "Item:Q959810"
From MaRDI portal
The following pages link to Succinct representations of planar maps (Q959810):
Displaying 19 items.
- A compact encoding of plane triangulations with efficient query supports (Q407553) (← links)
- Compact navigation and distance oracles for graphs with small treewidth (Q472468) (← links)
- I/O-efficient path traversal in succinct planar graphs (Q521807) (← links)
- Schnyder woods for higher genus triangulated surfaces, with applications to encoding (Q834610) (← links)
- A bijection for essentially 3-connected toroidal maps (Q2033922) (← links)
- Succinct navigational oracles for families of intersection graphs on a circle (Q2079878) (← links)
- Succinct representation for (non)deterministic finite automata (Q2084735) (← links)
- Navigating planar topologies in near-optimal space and time (Q2096370) (← links)
- On the number of planar Eulerian orientations (Q2400972) (← links)
- Succinct representation of labeled graphs (Q2428673) (← links)
- Succinct encodings for families of interval graphs (Q2661990) (← links)
- Succinct encoding of binary strings representing triangulations (Q2665909) (← links)
- Succinct and Implicit Data Structures for Computational Geometry (Q2848977) (← links)
- CATALOG-BASED REPRESENTATION OF 2D TRIANGULATIONS (Q2893456) (← links)
- Recent Developments in Floorplan Representations (Q5135264) (← links)
- Fast and compact planar embeddings (Q5918983) (← links)
- (Q6065424) (← links)
- Succinct data structure for path graphs (Q6178455) (← links)
- Succinct data structures for bounded clique-width graphs (Q6497944) (← links)
