The following pages link to (Q4535803):
Displaying 16 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)
- (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)
