Informative labeling schemes for graphs
From MaRDI portal
Publication:2566038
Recommendations
Cites work
- scientific article; zbMATH DE number 1500540 (Why is no real title available?)
- scientific article; zbMATH DE number 2086375 (Why is no real title available?)
- scientific article; zbMATH DE number 2119757 (Why is no real title available?)
- scientific article; zbMATH DE number 1420896 (Why is no real title available?)
- A fast algorithm for Steiner trees
- An unexpected result in coding the vertices of a graph
- Coding the vertexes of a graph
- Distance labeling in graphs (extended abstract)
- Implicat Representation of Graphs
- Labelling and Implicit Routing in Networks
Cited in
(20)- Online computation with advice
- scientific article; zbMATH DE number 1759444 (Why is no real title available?)
- Randomized proof-labeling schemes
- Better distance labeling for unweighted planar graphs
- A dynamic distributed approach to representing proper interval graphs
- Ramsey partitions and proximity data structures
- Better distance labeling for unweighted planar graphs
- Compact separator decompositions in dynamic trees and applications to labeling schemes
- Labeling Schemes with Queries
- scientific article; zbMATH DE number 1029246 (Why is no real title available?)
- Distributed Data Structures: A Survey on Informative Labeling Schemes
- Labeling schemes for weighted dynamic trees
- Constructing labeling schemes through universal matrices
- scientific article; zbMATH DE number 7765385 (Why is no real title available?)
- Shorter Labeling Schemes for Planar Graphs
- Proof labeling schemes
- scientific article; zbMATH DE number 7561659 (Why is no real title available?)
- Fault-tolerant distance labeling for planar graphs
- Fault-tolerant distance labeling for planar graphs
- Distance and routing labeling schemes for cube-free median graphs
This page was built for publication: Informative labeling schemes for graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2566038)