New results in graph routing
From MaRDI portal
Publication:690239
Recommendations
- New results on routing via matchings on graphs
- Routing in graphs
- A new approach for routing in arrangement graphs and its performance evaluation
- New hardness results for routing on disjoint paths
- New hardness results for routing on disjoint paths
- On compact and efficient routing in certain graph classes
- Dynamic Routing Schemes for General Graphs
- Publication:3210199
Cited in
(10)- Fault-tolerant fixed routing in hypercube generalizations
- An efficient fault-tolerant routing algorithm in bijective connection networks with restricted faulty edges
- Routing in graphs
- scientific article; zbMATH DE number 1769329 (Why is no real title available?)
- Optimal fault-tolerant routings with small routing tables for \(k\)-connected graphs
- A new look at fault-tolerant network routing
- Fault tolerant routing in the star and pancake interconnection networks
- Efficient algorithms for tripartitioning triconnected graphs and 3-edge-connected graphs
- A new approach for routing in arrangement graphs and its performance evaluation
- Highly fault-tolerant routings and diameter vulnerability for generalized hypercube graphs
This page was built for publication: New results in graph routing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q690239)