Pages that link to "Item:Q4828935"
From MaRDI portal
The following pages link to Linear-Time Compression of Bounded-Genus Graphs into Information-Theoretically Optimal Number of Bits (Q4828935):
Displayed 4 items.
- 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)
- (Q5494926) (redirect page) (← links)