Pages that link to "Item:Q800734"
From MaRDI portal
The following pages link to On the succinct representation of graphs (Q800734):
Displaying 29 items.
- Linearity is strictly more powerful than contiguity for encoding graphs (Q284761) (← links)
- Succinct encoding of arbitrary graphs (Q391972) (← links)
- (Nearly-)tight bounds on the contiguity and linearity of cographs (Q393888) (← links)
- A compact encoding of plane triangulations with efficient query supports (Q407553) (← links)
- The saga of minimum spanning trees (Q458468) (← links)
- Compact navigation and distance oracles for graphs with small treewidth (Q472468) (← links)
- Finite presentation of homogeneous graphs, posets and Ramsey classes (Q814132) (← links)
- Schnyder woods for higher genus triangulated surfaces, with applications to encoding (Q834610) (← links)
- Trading uninitialized space for time (Q834884) (← links)
- Succinct representations of planar maps (Q959810) (← links)
- Quick encoding of plane graphs in \(\log _{2}14\) bits per edge (Q975433) (← links)
- Simple planar graph partition into three forests (Q1392570) (← links)
- Graph compression by BFS (Q1662490) (← links)
- Short encodings of planar graphs and maps (Q1805444) (← links)
- Navigating planar topologies in near-optimal space and time (Q2096370) (← links)
- Succinct representation of general unlabeled graphs (Q2277480) (← links)
- Planar graphs, via well-orderly maps and trees (Q2502033) (← links)
- Succinct encoding of binary strings representing triangulations (Q2665909) (← links)
- Asymptotic enumeration and limit laws of planar graphs (Q3079198) (← links)
- Linearity Is Strictly More Powerful Than Contiguity for Encoding Graphs (Q3449818) (← links)
- Succinct Representations of Arbitrary Graphs (Q3541102) (← links)
- A Census of Plane Graphs with Polyline Edges (Q5267999) (← links)
- A Compact Encoding of Plane Triangulations with Efficient Query Supports (Q5452159) (← links)
- Fast and compact planar embeddings (Q5918983) (← links)
- Representing graphs implicitly using almost optimal space (Q5928875) (← links)
- An edgebreaker-based efficient compression scheme for regular meshes (Q5952971) (← links)
- Compact representations of spatial hierarchical structures with support for topological queries (Q6040665) (← links)
- Implementing the topological model succinctly (Q6536274) (← links)
- Dynamic compact planar embeddings (Q6545429) (← links)
