Pages that link to "Item:Q4651544"
From MaRDI portal
The following pages link to Traveling with a Pez Dispenser (or, Routing Issues in MPLS) (Q4651544):
Displaying 21 items.
- Compact and low delay routing labeling scheme for unit disk graphs (Q419502) (← links)
- GMPLS label space minimization through hypergraph layouts (Q442249) (← links)
- Collective additive tree spanners for circle graphs and polygonal graphs (Q444436) (← links)
- On the advice complexity of the \(k\)-server problem under sparse metrics (Q503460) (← links)
- Spanners in sparse graphs (Q657919) (← links)
- Collective tree spanners in graphs with bounded parameters (Q848633) (← links)
- Enhancing label space usage for ethernet VLAN-label switching (Q1017496) (← links)
- On the solution of reroute sequence planning problem in MPLS networks. (Q1400462) (← links)
- Routing in unit disk graphs (Q1742368) (← links)
- A note on exact distance labeling (Q1944109) (← links)
- Covering metric spaces by few trees (Q2168848) (← links)
- Collective additive tree spanners of bounded tree-breadth graphs with generalizations and consequences (Q2253192) (← links)
- Additive spanners and distance and routing labeling schemes for hyperbolic graphs (Q2428695) (← links)
- On Advice Complexity of the k-server Problem under Sparse Metrics (Q2868631) (← links)
- Compact and Low Delay Routing Labeling Scheme for Unit Disk Graphs (Q3183486) (← links)
- Metric Embedding via Shortest Path Decompositions (Q5071090) (← links)
- Local Fast Segment Rerouting on Hypercubes (Q5091084) (← links)
- Covering Metric Spaces by Few Trees (Q5091169) (← links)
- Additive Spanners for Circle Graphs and Polygonal Graphs (Q5302048) (← links)
- Collective Additive Tree Spanners of Homogeneously Orderable Graphs (Q5458559) (← links)
- Fault-tolerant distance labeling for planar graphs (Q5918639) (← links)
