Pages that link to "Item:Q2768294"

The following pages link to Distance labeling in graphs (extended abstract) (Q2768294):

Displaying 39 items.

• Threshold-coloring and unit-cube contact representation of planar graphs (Q344821) (← links)
• Trade-offs between the size of advice and broadcasting time in trees (Q547287) (← links)
• On distance constrained labeling of disk graphs (Q703553) (← links)
• A note on labeling schemes for graph connectivity (Q763487) (← links)
• Communication algorithms with advice (Q972382) (← links)
• Constructing labeling schemes through universal matrices (Q973000) (← links)
• Query efficient implementation of graphs of bounded clique-width (Q1408820) (← links)
• Distance labeling scheme and split decomposition (Q1417571) (← links)
• Computational complexity of distance edge labeling (Q1647838) (← links)
• New pairwise spanners (Q1693988) (← links)
• Temporal network optimization subject to connectivity constraints (Q1739101) (← links)
• Distance labeling schemes for well-separated graph classes (Q1765518) (← links)
• Interval routing in reliability networks (Q1770375) (← links)
• A note on exact distance labeling (Q1944109) (← links)
• Distributed verification of minimum spanning trees (Q1954247) (← links)
• Average case analysis for tree labelling schemes (Q2371804) (← links)
• The complexity of optimal design of temporally connected graphs (Q2408566) (← links)
• Distributed distance computation and routing with small messages (Q2422769) (← links)
• Informative labeling schemes for graphs (Q2566038) (← links)
• Prioritized Metric Structures and Embedding (Q2941541) (← links)
• Distance and routing labeling schemes for non-positively curved plane graphs (Q3414546) (← links)
• Distance Labeling for Permutation Graphs (Q3439382) (← links)
• Distance Labelling Problems for Hypercubes and Hamming Graphs – A Survey (Q3439628) (← links)
• Small Stretch Pairwise Spanners and Approximate $D$-Preservers (Q3452163) (← links)
• Lower Bounds in the Preprocessing and Query Phases of Routing Algorithms (Q3452861) (← links)
• An Experimental Study on Distance-Based Graph Drawing (Q3611854) (← links)
• Reachability and Distance Queries via 2-Hop Labels (Q4429688) (← links)
• Sublinear Distance Labeling (Q4606270) (← links)
• Graph distance‐dependent labeling related to code assignment in computer networks (Q4667824) (← links)
• (Q4944965) (← links)
• Proximity-preserving labeling schemes (Q4948512) (← links)
• List graphs and distance-consistent node labelings (Q5009976) (← links)
• On Verifying and Maintaining Connectivity of Interval Temporal Networks (Q5087856) (← links)
• Compact and localized distributed data structures (Q5138487) (← links)
• ReHub (Q5266603) (← links)
• Shortest Reconfiguration Paths in the Solution Space of Boolean Formulas (Q5361235) (← links)
• (Q5872528) (← links)
• (Q6065428) (← links)
• Distributed planar reachability in nearly optimal time (Q6535037) (← links)