Pages that link to "Item:Q3541102"
From MaRDI portal
The following pages link to Succinct Representations of Arbitrary Graphs (Q3541102):
Displaying 15 items.
- 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)
- On the succinct representation of graphs (Q800734) (← links)
- Representation of graphs by OBDDs (Q1003666) (← links)
- On the succinct representation of equivalence classes (Q2408100) (← links)
- Succinct representation of labeled graphs (Q2428673) (← links)
- GLOUDS: representing tree-like graphs (Q2634715) (← links)
- Succinct encodings for families of interval graphs (Q2661990) (← links)
- Succinct and Implicit Data Structures for Computational Geometry (Q2848977) (← links)
- Compact Navigation and Distance Oracles for Graphs with Small Treewidth (Q3012812) (← links)
- (Q4694758) (← links)
- A note on succinct representations of graphs (Q4725746) (← links)
- Succinct Encodings of Graph Isomorphism (Q5404919) (← links)
- (Q6065424) (← links)