Implicit representation of relations
From MaRDI portal
Publication:6185606
DOI10.1007/S00224-023-10141-ZzbMath1530.05160OpenAlexW4385837231MaRDI QIDQ6185606
Vladan Glončák, Jarl Emil Erla Munkstrup, Jakob Grue Simonsen
Publication date: 8 January 2024
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00224-023-10141-z
Graph theory (including graph drawing) in computer science (68R10) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Data structures (68P05) Information storage and retrieval of data (68P20)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Compact separator decompositions in dynamic trees and applications to labeling schemes
- Compact labelings for efficient first-order model-checking
- Labeling schemes for dynamic tree networks
- Decomposing a relation into a tree of binary relations
- Labeling schemes for tree representation
- Theory of relations. Transl. from the French by P. Clote. With an appendix by Norbert Sauer.
- Canonical representations for circular-arc graphs using flip sets
- A note on exact distance labeling
- Additive spanners and distance and routing labeling schemes for hyperbolic graphs
- Labeling schemes for weighted dynamic trees
- An unexpected result in coding the vertices of a graph
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- Distance and routing labeling schemes for non-positively curved plane graphs
- Shorter Implicit Representation for Planar Graphs and Bounded Treewidth Graphs
- On optimizing an SQL-like nested query
- Implicat Representation of Graphs
- Distance labeling schemes for trees
- Near Optimal Adjacency Labeling Schemes for Power-Law Graphs
- Sublinear Distance Labeling
- Adjacency Labeling Schemes and Induced-Universal Graphs
- Optimal Induced Universal Graphs and Adjacency Labeling for Trees
- Distance labeling in graphs
- On density of subgraphs of Cartesian products
- Compact and localized distributed data structures
- On minimal n-universal graphs
- Compact oracles for reachability and approximate distances in planar digraphs
- Coding the vertexes of a graph
- An introduction to Kolmogorov complexity and its applications
This page was built for publication: Implicit representation of relations
