scientific article; zbMATH DE number 7651175
From MaRDI portal
Publication:5874505
DOI10.4230/LIPIcs.ESA.2020.36MaRDI QIDQ5874505
Publication date: 7 February 2023
Full work available at URL: https://arxiv.org/abs/2007.02427
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (1)
Cites Work
- Routing, merging, and sorting on parallel models of computation
- Designing networks with compact routing tables
- Compact Routing with Minimum Stretch
- Memory requirement for routing in distributed networks
- Tight bounds for oblivious routing in the hypercube
- A Scheme for Fast Parallel Communication
- Extremal problems in graph theory
- On-line routing in all-optical networks
- Memory requirement for universal routing schemes
- Computing Cut-Based Hierarchical Decompositions in Almost Linear Time
- Graph partitioning using single commodity flows
- Optimal oblivious routing in polynomial time
- Compact policy routing
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication:
