Distance labeling in graphs (extended abstract)
From MaRDI portal
Recommendations
- Distance labellings of graphs
- Distance labeling in graphs
- scientific article; zbMATH DE number 1409224
- Distance-two labelings of graphs
- On distance irregular labelling of graphs
- Algorithms and Computation
- On L(2,1)-labellings of distance graphs
- scientific article; zbMATH DE number 1500540
- Distance labeling schemes for well-separated graph classes
- Distance between graphs using graph labelings.
Cited in
(43)- Query efficient implementation of graphs of bounded clique-width
- Distance labeling scheme and split decomposition
- New pairwise spanners
- Temporal network optimization subject to connectivity constraints
- Distance labeling schemes for well-separated graph classes
- Interval routing in reliability networks
- A note on exact distance labeling
- Distributed verification of minimum spanning trees
- Average case analysis for tree labelling schemes
- The complexity of optimal design of temporally connected graphs
- Distributed distance computation and routing with small messages
- Informative labeling schemes for graphs
- Distance and routing labeling schemes for non-positively curved plane graphs
- Distance Labeling for Permutation Graphs
- Distance Labelling Problems for Hypercubes and Hamming Graphs – A Survey
- Threshold-coloring and unit-cube contact representation of planar graphs
- Small stretch pairwise spanners and approximate D-preservers
- Lower bounds in the preprocessing and query phases of routing algorithms
- An Experimental Study on Distance-Based Graph Drawing
- Reachability and Distance Queries via 2-Hop Labels
- Simpler, faster and shorter labels for distances in graphs
- Distance labeling schemes for trees
- Sublinear Distance Labeling
- Near-optimal compression for the planar graph metric
- Graph distance‐dependent labeling related to code assignment in computer networks
- Distance labeling in graphs
- scientific article; zbMATH DE number 1420896 (Why is no real title available?)
- Proximity-preserving labeling schemes
- List graphs and distance-consistent node labelings
- On verifying and maintaining connectivity of interval temporal networks
- Compact and localized distributed data structures
- ReHub: extending hub labels for reverse k-nearest neighbor queries on large-scale networks
- Shortest reconfiguration paths in the solution space of Boolean formulas
- Trade-offs between the size of advice and broadcasting time in trees
- scientific article; zbMATH DE number 7637429 (Why is no real title available?)
- scientific article; zbMATH DE number 7765385 (Why is no real title available?)
- Better distance labeling for unweighted planar graphs
- Distributed planar reachability in nearly optimal time
- On distance constrained labeling of disk graphs
- A note on labeling schemes for graph connectivity
- Better distance labeling for unweighted planar graphs
- Communication algorithms with advice
- Constructing labeling schemes through universal matrices
This page was built for publication: Distance labeling in graphs (extended abstract)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2768294)
