The following pages link to (Q4535803):
Displaying 34 items.
- Compact separator decompositions in dynamic trees and applications to labeling schemes (Q352249) (← links)
- Compact and low delay routing labeling scheme for unit disk graphs (Q419502) (← links)
- Distributed computing of efficient routing schemes in generalized chordal graphs (Q442251) (← links)
- \(k\)-chordal graphs: from cops and robber to compact routing via treewidth (Q494802) (← links)
- Fast and compact self-stabilizing verification, computation, and fault detection of an MST (Q498670) (← links)
- How much memory is needed for leader election (Q661049) (← links)
- Collective tree spanners in graphs with bounded parameters (Q848633) (← links)
- Constructing labeling schemes through universal matrices (Q973000) (← links)
- On compact and efficient routing in certain graph classes (Q997073) (← links)
- A note on models for graph representations (Q1008739) (← links)
- Labeling schemes for tree representation (Q1017912) (← links)
- Compact routing messages in self-healing trees (Q1686108) (← links)
- Routing in unit disk graphs (Q1742368) (← links)
- Distance labeling schemes for well-separated graph classes (Q1765518) (← links)
- How to meet when you forget: log-space rendezvous in arbitrary graphs (Q1938363) (← links)
- General compact labeling schemes for dynamic trees (Q1954239) (← links)
- Distributed verification of minimum spanning trees (Q1954247) (← links)
- Randomized proof-labeling schemes (Q2002054) (← links)
- Routing among convex polygonal obstacles in the plane (Q2149846) (← links)
- Routing in polygonal domains (Q2173455) (← links)
- Near-optimal induced universal graphs for cycles and paths (Q2185721) (← links)
- Distance and routing labeling schemes for cube-free median graphs (Q2223698) (← links)
- Name-independent compact routing in trees (Q2379942) (← links)
- Additive spanners and distance and routing labeling schemes for hyperbolic graphs (Q2428695) (← links)
- Labeling schemes for weighted dynamic trees (Q2464140) (← links)
- Max-stretch reduction for tree spanners (Q2480904) (← links)
- On Approximate Distance Labels and Routing Schemes with Affine Stretch (Q3095345) (← links)
- Compact and Low Delay Routing Labeling Scheme for Unit Disk Graphs (Q3183486) (← links)
- Distributed Computing of Efficient Routing Schemes in Generalized Chordal Graphs (Q3408176) (← links)
- (Q5075823) (← links)
- Routing in Polygonal Domains (Q5136225) (← links)
- Compact and localized distributed data structures (Q5138487) (← links)
- (Q5874505) (← links)
- Compact Routing in Unit Disk Graphs (Q6065413) (← links)
