Pages that link to "Item:Q1805444"
From MaRDI portal
The following pages link to Short encodings of planar graphs and maps (Q1805444):
Displaying 23 items.
- Succinct encoding of arbitrary graphs (Q391972) (← links)
- A compact encoding of plane triangulations with efficient query supports (Q407553) (← links)
- Compact navigation and distance oracles for graphs with small treewidth (Q472468) (← links)
- Linear-time compression of 2-manifold polygon meshes into information-theoretically optimal number of bits (Q545998) (← links)
- Schnyder woods for higher genus triangulated surfaces, with applications to encoding (Q834610) (← links)
- Succinct representations of planar maps (Q959810) (← links)
- Quick encoding of plane graphs in \(\log _{2}14\) bits per edge (Q975433) (← links)
- On the OBDD size for graphs of bounded tree- and clique-width (Q1011721) (← links)
- Simple planar graph partition into three forests (Q1392570) (← links)
- Navigating planar topologies in near-optimal space and time (Q2096370) (← links)
- The space complexity of sum labelling (Q2140502) (← links)
- Planar graphs, via well-orderly maps and trees (Q2502033) (← links)
- Compact representation of graphs with bounded bandwidth or treedepth (Q2672250) (← links)
- Bounding the number of reduced trees, cographs, and series-parallel graphs by compression (Q2846474) (← links)
- Succinct Representations of Arbitrary Graphs (Q3541102) (← links)
- Shortcutting Planar Digraphs (Q4862749) (← links)
- A Compact Encoding of Plane Triangulations with Efficient Query Supports (Q5452159) (← links)
- Graph-Theoretic Concepts in Computer Science (Q5710808) (← links)
- Shorter Labeling Schemes for Planar Graphs (Q5866447) (← links)
- Fast and compact planar embeddings (Q5918983) (← links)
- An edgebreaker-based efficient compression scheme for regular meshes (Q5952971) (← links)
- The space complexity of sum labelling (Q6056630) (← links)
- Dynamic compact planar embeddings (Q6545429) (← links)
