Forwarding indices of consistent routings and their complexity

DOI10.1002/net.3230240204zbMath0804.90041OpenAlexW2095260945MaRDI QIDQ4284078

No author found.

Publication date: 24 April 1994

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.3230240204

zbMATH Keywords

routingedge-forwarding indexvertex-forwarding index

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06)

Related Items (12)

Counterexamples to the uniform shortest path routing conjecture for vertex-transitive graphs ⋮ The forwarding indices of augmented cubes ⋮ Large fault-tolerant interconnection networks ⋮ On the edge-forwarding indices of Frobenius graphs ⋮ Recursive cubes of rings as models for interconnection networks ⋮ The forwarding index of communication networks with given connectivity ⋮ Forwarding indices of folded \(n\)-cubes ⋮ The forwarding indices of wrapped butterfly networks ⋮ Cube-connected circulants: bisection width, Wiener and forwarding indices ⋮ Forwarding and optical indices of a graph ⋮ On the restricted forwarding index problem in communication networks ⋮ Static and dynamic low-congested interval routing schemes

This page was built for publication: Forwarding indices of consistent routings and their complexity