scientific article; zbMATH DE number 7765385

DOI10.4230/lipics.isaac.2020.27arXiv2007.06105MaRDI QIDQ6065428

Unnamed Author, Paweł Gawrychowski, Unnamed Author

Publication date: 14 November 2023

Full work available at URL: https://arxiv.org/abs/2007.06105

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

reachabilityDAGinformative labeling scheme

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Succinct posets
• Asymptotically optimal induced universal graphs
• Finding bipartite subgraphs efficiently
• Sublinear-space distance labeling using hubs
• Clique partitions, graph compression and speeding-up algorithms
• Informative labeling schemes for graphs
• Deterministic Dictionaries
• Adjacency Labeling Schemes and Induced-Universal Graphs
• Implicat Representation of Graphs
• Optimal induced universal graphs for bounded-degree graphs
• Sublinear Distance Labeling
• Optimal Induced Universal Graphs and Adjacency Labeling for Trees
• Labeling Schemes for Flow and Connectivity
• Hardness of Exact Distance Queries in Sparse Graphs Through Hub Labeling
• Shorter Labeling Schemes for Planar Graphs
• On minimal n-universal graphs
• Optimal Distance Labeling Schemes for Trees
• Near-optimal labeling schemes for nearest common ancestors
• Labeling Schemes for Small Distances in Trees
• The Number of Finite Topologies

This page was built for publication: