The following pages link to Implicat Representation of Graphs (Q4030198):
Displaying 50 items.
- On the OBDD representation of some graph classes (Q317396) (← links)
- Compact separator decompositions in dynamic trees and applications to labeling schemes (Q352249) (← links)
- Succinct encoding of arbitrary graphs (Q391972) (← links)
- Sphere and dot product representations of graphs (Q411410) (← links)
- On symbolic OBDD-based algorithms for the minimum spanning tree problem (Q443706) (← links)
- Compact navigation and distance oracles for graphs with small treewidth (Q472468) (← links)
- Implicit representations and factorial properties of graphs (Q472962) (← links)
- Asymptotically optimal induced universal graphs (Q521601) (← links)
- On forbidden induced subgraphs for unit disk graphs (Q724944) (← links)
- A note on labeling schemes for graph connectivity (Q763487) (← links)
- Better distance labeling for unweighted planar graphs (Q832885) (← links)
- Induced-universal graphs for graphs with bounded maximum degree (Q844226) (← links)
- An implicit representation of chordal comparability graphs in linear time (Q972319) (← links)
- Constructing labeling schemes through universal matrices (Q973000) (← links)
- On induced-universal graphs for the class of bounded-degree graphs (Q975466) (← links)
- A note on models for graph representations (Q1008739) (← links)
- On the OBDD size for graphs of bounded tree- and clique-width (Q1011721) (← links)
- Labeling schemes for tree representation (Q1017912) (← links)
- Localized and compact data-structure for comparability graphs (Q1025540) (← links)
- A dynamic distributed approach to representing proper interval graphs (Q1045060) (← links)
- Local representations using very short labels (Q1301676) (← links)
- Dot product representations of graphs (Q1381853) (← links)
- Simple planar graph partition into three forests (Q1392570) (← links)
- Distance labeling scheme and split decomposition (Q1417571) (← links)
- Parameterized complexity of the list coloring reconfiguration problem with graph parameters (Q1643161) (← links)
- Implicit representation conjecture for semi-algebraic graphs (Q1735676) (← links)
- General compact labeling schemes for dynamic trees (Q1954239) (← links)
- Distributed verification of minimum spanning trees (Q1954247) (← links)
- Constrained-path labellings on graphs of bounded clique-width (Q1959385) (← links)
- A simple greedy algorithm for dynamic graph orientation (Q1986959) (← links)
- Randomized proof-labeling schemes (Q2002054) (← links)
- Notes on graph product structure theory (Q2058955) (← links)
- A counter-example to the probabilistic universal graph conjecture via randomized communication complexity (Q2081471) (← links)
- The space complexity of sum labelling (Q2140502) (← links)
- Graph parameters, implicit representations and factorial properties (Q2169939) (← links)
- An adjacency labeling scheme based on a decomposition of trees into caterpillars (Q2169946) (← links)
- Near-optimal induced universal graphs for cycles and paths (Q2185721) (← links)
- Distance and routing labeling schemes for cube-free median graphs (Q2223698) (← links)
- An efficient implicit data structure for relation testing and searching in partially ordered sets (Q2366649) (← links)
- Average case analysis for tree labelling schemes (Q2371804) (← links)
- Proof labeling schemes (Q2377139) (← links)
- On the succinct representation of equivalence classes (Q2408100) (← links)
- Labeling schemes for weighted dynamic trees (Q2464140) (← links)
- Informative labeling schemes for graphs (Q2566038) (← links)
- GLOUDS: representing tree-like graphs (Q2634715) (← links)
- Effective storage capacity of labeled graphs (Q2637317) (← links)
- A fast algorithm for the product structure of planar graphs (Q2663717) (← links)
- Universal graphs and universal permutations (Q2874053) (← links)
- Orienting Dynamic Graphs, with Applications to Maximal Matchings and Adjacency Queries (Q2942621) (← links)
- Secure Authenticated Comparisons (Q3011317) (← links)
