Pages that link to "Item:Q4507374"
From MaRDI portal
The following pages link to A Fast General Methodology for Information-Theoretically Optimal Encodings of Graphs (Q4507374):
Displayed 12 items.
- Building knowledge maps of web graphs (Q322080) (← links)
- A compact encoding of plane triangulations with efficient query supports (Q407553) (← links)
- Tight and simple web graph compression for forward and reverse neighbor queries (Q496546) (← links)
- Linear-time compression of 2-manifold polygon meshes into information-theoretically optimal number of bits (Q545998) (← links)
- Graph compression and the zeros of polynomials (Q834888) (← links)
- Quick encoding of plane graphs in \(\log _{2}14\) bits per edge (Q975433) (← links)
- Navigating planar topologies in near-optimal space and time (Q2096370) (← links)
- Linear-time algorithms for tree root problems (Q2346968) (← links)
- Succinct encoding of binary strings representing triangulations (Q2665909) (← links)
- A Compact Encoding of Plane Triangulations with Efficient Query Supports (Q5452159) (← links)
- Fast and compact planar embeddings (Q5918983) (← links)
- An edgebreaker-based efficient compression scheme for regular meshes (Q5952971) (← links)