The following pages link to (Q4471358):
Displayed 21 items.
- Building knowledge maps of web graphs (Q322080) (← links)
- Succinct encoding of arbitrary graphs (Q391972) (← links)
- Compact navigation and distance oracles for graphs with small treewidth (Q472468) (← links)
- I/O-efficient path traversal in succinct planar graphs (Q521807) (← links)
- Compact representation of graphs of small clique-width (Q724221) (← links)
- Graph compression and the zeros of polynomials (Q834888) (← links)
- Quick encoding of plane graphs in \(\log _{2}14\) bits per edge (Q975433) (← links)
- Geometric inhomogeneous random graphs (Q1713405) (← links)
- Succinct representation of labeled graphs (Q2428673) (← links)
- GLOUDS: representing tree-like graphs (Q2634715) (← links)
- Succinct encoding of binary strings representing triangulations (Q2665909) (← links)
- Compact representation of graphs with bounded bandwidth or treedepth (Q2672250) (← links)
- Compact Navigation and Distance Oracles for Graphs with Small Treewidth (Q3012812) (← links)
- Efficient Compression of Web Graphs (Q3511306) (← links)
- Succinct Representations of Arbitrary Graphs (Q3541102) (← links)
- Some Typical Properties of the Spatial Preferred Attachment Model (Q4985351) (← links)
- (Q5009600) (← links)
- (Q5111706) (← links)
- A Geometric Preferential Attachment Model of Networks II (Q5458299) (← links)
- Expansion and Lack Thereof in Randomly Perturbed Graphs (Q5900217) (← links)
- Fast and compact planar embeddings (Q5918983) (← links)