Complexity of the Forwarding Index Problem
From MaRDI portal
Publication:3136613
DOI10.1137/0406033zbMath0781.68071OpenAlexW2086928157MaRDI QIDQ3136613
Publication date: 14 October 1993
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0406033
Analysis of algorithms and problem complexity (68Q25) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10)
Related Items (16)
Upper bounds for the forwarding indices of communication networks ⋮ The forwarding indices of augmented cubes ⋮ The forwarding index of directed networks ⋮ Concurrent flows and packet routing in Cayley graphs (Preliminary version) ⋮ Distance eigenvalues and forwarding indices of circulants ⋮ Recursive cubes of rings as models for interconnection networks ⋮ The forwarding index of communication networks with given connectivity ⋮ Constructing integral uniform flows in symmetric networks with application to the edge-forwarding index problem ⋮ Forwarding indices of folded \(n\)-cubes ⋮ Low-congested interval routing schemes for hypercubelike networks ⋮ Cube-connected circulants: bisection width, Wiener and forwarding indices ⋮ Forwarding and optical indices of a graph ⋮ Forwarding index of cube-connected cycles ⋮ On the restricted forwarding index problem in communication networks ⋮ Unnamed Item ⋮ Static and dynamic low-congested interval routing schemes
This page was built for publication: Complexity of the Forwarding Index Problem
