Minimal storage representations for binary relations
From MaRDI portal
Publication:789170
DOI10.1016/0020-0190(82)90088-6zbMath0532.68030OpenAlexW2037716755MaRDI QIDQ789170
D. E. Swartwout, Jeffrey C. Lagarias
Publication date: 1982
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(82)90088-6
Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Data structures (68P05) Information storage and retrieval of data (68P20) Other classical set theory (including functions, relations, and set algebra) (03E20)
Related Items
Cites Work
- Unnamed Item
- Choosing a storage schema
- Minimal storage representations for binary relations
- Uniform data encodings
- Data encodings and their costs
- Encoding Data Structures in Trees
- Storage representations for tree-like data structures
- Toward a theory of encoded data structures and data translation
- Bounds on the costs of data encodings
- Efficient Storage and Retrieval by Content and Address of Static Files