The following pages link to Implicat Representation of Graphs (Q4030198):
Displaying 38 items.
- How to Share a Secret, Infinitely (Q3181038) (← links)
- Distance Labeling for Permutation Graphs (Q3439382) (← links)
- A Simple and Optimal Ancestry Labeling Scheme for Trees (Q3449505) (← links)
- Succinct Representations of Arbitrary Graphs (Q3541102) (← links)
- Adjacency Labeling Schemes and Induced-Universal Graphs (Q4610450) (← links)
- Optimal induced universal graphs for bounded-degree graphs (Q4614763) (← links)
- Induced Universal Hypergraphs (Q4631098) (← links)
- Isometric Universal Graphs (Q4992841) (← links)
- (Q5009573) (← links)
- Twin-width II: small classes (Q5051371) (← links)
- Value Iteration Using Universal Graphs and the Complexity of Mean Payoff Games (Q5089201) (← links)
- (Q5092373) (← links)
- Parameterized Complexity of the List Coloring Reconfiguration Problem with Graph Parameters (Q5111266) (← links)
- (Q5136228) (← links)
- Compact and localized distributed data structures (Q5138487) (← links)
- Shortest-path queries in static networks (Q5176178) (← links)
- Implicit Component-Graph: A Discussion (Q5270553) (← links)
- On Universal Graphs of Minor Closed Families (Q5300987) (← links)
- Efficient Local Representations of Graphs (Q5506777) (← links)
- Shorter Labeling Schemes for Planar Graphs (Q5866447) (← links)
- Short Labels by Traversal and Jumping (Q5899392) (← links)
- Combinatorics and algorithms for quasi-chain graphs (Q5918620) (← links)
- Fault-tolerant distance labeling for planar graphs (Q5918639) (← links)
- Combinatorics and algorithms for quasi-chain graphs (Q5925628) (← links)
- Representing graphs implicitly using almost optimal space (Q5928875) (← links)
- Fault-tolerant distance labeling for planar graphs (Q5970814) (← links)
- The space complexity of sum labelling (Q6056630) (← links)
- (Q6065428) (← links)
- Sparse universal graphs for planarity (Q6085077) (← links)
- Better distance labeling for unweighted planar graphs (Q6103529) (← links)
- Optimal embeddings of the exchanged hypercube and the dual-cube as vertex-induced subgraphs of the hypercube (Q6162041) (← links)
- Graph product structure for non-minor-closed classes (Q6170788) (← links)
- Logical labeling schemes (Q6172301) (← links)
- Graph parameters, implicit representations and factorial properties (Q6172309) (← links)
- Implicit representation of relations (Q6185606) (← links)
- Optimal adjacency labels for subgraphs of Cartesian products (Q6581611) (← links)
- Implicit representation of sparse hereditary families (Q6624164) (← links)
- Small but unwieldy: a lower bound on adjacency labels for small classes (Q6631355) (← links)
