Implicat Representation of Graphs
From MaRDI portal
Publication:4030198
Recommendations
- scientific article; zbMATH DE number 1262796
- Shorter Implicit Representation for Planar Graphs and Bounded Treewidth Graphs
- Representing graphs implicitly using almost optimal space
- Graph parameters, implicit representations and factorial properties
- Implicit representations and factorial properties of graphs
Cited in
(90)- Induced-universal graphs for graphs with bounded maximum degree
- A simple greedy algorithm for dynamic graph orientation
- Universal graphs and universal permutations
- Localized and compact data-structure for comparability graphs
- On induced-universal graphs for the class of bounded-degree graphs
- Simple planar graph partition into three forests
- Better distance labeling for unweighted planar graphs
- Short Labels by Traversal and Jumping
- Graph parameters, implicit representations and factorial properties
- Parameterized Complexity of the List Coloring Reconfiguration Problem with Graph Parameters
- Isometric universal graphs
- An implicit representation of chordal comparability graphs in linear time
- Constructing labeling schemes through universal matrices
- Adjacency labeling schemes and induced-universal graphs
- General compact labeling schemes for dynamic trees
- Implicit representation conjecture for semi-algebraic graphs
- Distributed verification of minimum spanning trees
- scientific article; zbMATH DE number 7561659 (Why is no real title available?)
- Informative labeling schemes for graphs
- Shorter Implicit Representation for Planar Graphs and Bounded Treewidth Graphs
- Compact and localized distributed data structures
- On the succinct representation of equivalence classes
- Optimal adjacency labels for subgraphs of Cartesian products
- Constrained-path labellings on graphs of bounded clique-width
- Graph product structure for non-minor-closed classes
- Labeling schemes for weighted dynamic trees
- On forbidden induced subgraphs for unit disk graphs
- Fault-tolerant distance labeling for planar graphs
- Fault-tolerant distance labeling for planar graphs
- Optimal embeddings of the exchanged hypercube and the dual-cube as vertex-induced subgraphs of the hypercube
- Better distance labeling for unweighted planar graphs
- GLOUDS: representing tree-like graphs
- Parameterized complexity of the list coloring reconfiguration problem with graph parameters
- Distance labeling scheme and split decomposition
- The space complexity of sum labelling
- Near-optimal distance emulator for planar graphs
- Local representations using very short labels
- Induced universal hypergraphs
- Logical labeling schemes
- On the OBDD representation of some graph classes
- A simple and optimal ancestry labeling scheme for trees
- On symbolic OBDD-based algorithms for the minimum spanning tree problem
- Implicit representation of relations
- Near-optimal induced universal graphs for cycles and paths
- Average case analysis for tree labelling schemes
- scientific article; zbMATH DE number 7765385 (Why is no real title available?)
- Implicit representation of sparse hereditary families
- Secure authenticated comparisons
- Succinct encoding of arbitrary graphs
- Sphere and dot product representations of graphs
- Compact navigation and distance oracles for graphs with small treewidth
- Implicit representations and factorial properties of graphs
- Proof labeling schemes
- Labeling schemes for tree representation
- Value Iteration Using Universal Graphs and the Complexity of Mean Payoff Games
- Shorter Labeling Schemes for Planar Graphs
- Representing graphs implicitly using almost optimal space
- Shortest-path queries in static networks
- A note on models for graph representations
- On the OBDD size for graphs of bounded tree- and clique-width
- Distance Labeling for Permutation Graphs
- Small but unwieldy: a lower bound on adjacency labels for small classes
- Implicit Component-Graph: A Discussion
- A note on labeling schemes for graph connectivity
- An adjacency labeling scheme based on a decomposition of trees into caterpillars
- Distance and routing labeling schemes for cube-free median graphs
- Effective storage capacity of labeled graphs
- Combinatorics and algorithms for quasi-chain graphs
- Combinatorics and algorithms for quasi-chain graphs
- Deterministic Fault-Tolerant Connectivity Labeling Scheme
- Twin-width II: small classes
- How to Share a Secret, Infinitely
- Compact separator decompositions in dynamic trees and applications to labeling schemes
- Succinct Representations of Arbitrary Graphs
- The space complexity of sum labelling
- A dynamic distributed approach to representing proper interval graphs
- Dot product representations of graphs
- On universal graphs of minor closed families
- Sparse universal graphs for planarity
- Graph parameters, implicit representations and factorial properties
- Randomized proof-labeling schemes
- A fast algorithm for the product structure of planar graphs
- Notes on graph product structure theory
- A simple greedy algorithm for dynamic graph orientation
- Efficient local representations of graphs
- A counter-example to the probabilistic universal graph conjecture via randomized communication complexity
- Asymptotically optimal induced universal graphs
- Optimal induced universal graphs for bounded-degree graphs
- An efficient implicit data structure for relation testing and searching in partially ordered sets
- Orienting dynamic graphs, with applications to maximal matchings and adjacency queries
This page was built for publication: Implicat Representation of Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4030198)
