Recommendations
Cites work
- scientific article; zbMATH DE number 3654142 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1262789 (Why is no real title available?)
- scientific article; zbMATH DE number 2102779 (Why is no real title available?)
- scientific article; zbMATH DE number 1421019 (Why is no real title available?)
- Algorithms and Computation
- All-to-all communication for some wavelength-routed all-optical networks
- All-to-all wavelength-routing in all-optical compound networks
- Colouring paths in directed symmetric trees with applications to WDM routing
- Complexity of the Forwarding Index Problem
- Efficient routing in all-optical networks
- Expanding and forwarding
- Forwarding indices of consistent routings and their complexity
- On forwarding indices of networks
- On the edge forwarding index problem for small graphs
- Optimal wavelength-routed multicasting
- The forwarding index of communication networks
- The maximum edge-disjoint paths problem in complete graphs
Cited in
(5)- Forwarding and optical indices of 4-regular circulant networks
- Optical Routing of Uniform Instances in Cayley Graphs
- scientific article; zbMATH DE number 1754617 (Why is no real title available?)
- The undirected optical indices of complete \(m\)-ary trees
- Recursive cubes of rings as models for interconnection networks
This page was built for publication: Forwarding and optical indices of a graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1003676)