Routing Symmetric Demands in Directed Minor-Free Graphs with Constant Congestion.
Timothy CarpenterArio SalmasiAnastasios SidiropoulosPublished in: APPROX-RANDOM (2019)
Keyphrases
- dynamic routing
- packet transmission
- graph theory
- graph matching
- routing protocol
- graph representation
- routing problem
- routing decisions
- graph mining
- network topology
- ad hoc networks
- bipartite graph
- graph theoretic
- service requirements
- directed graph
- graph structure
- shortest path
- undirected graph
- graph kernels
- link failure
- multicast routing
- real time traffic
- load balancing