Constructing integral uniform flows in symmetric networks with application to the edge-forwarding index problem

DOI10.1016/S0166-218X(00)00228-6zbMath0980.05031OpenAlexW2035416563MaRDI QIDQ5928874

Farhad Shahrokhi, László A. Székely

Publication date: 3 July 2001

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0166-218x(00)00228-6

zbMATH Keywords

butterflyCayley graphsedge-forwarding index uniform concurrent multicommodity flowintegral uniform flow

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (7)

The forwarding indices of augmented cubes ⋮ Recursive cubes of rings as models for interconnection networks ⋮ Forwarding indices of folded \(n\)-cubes ⋮ The forwarding indices of wrapped butterfly networks ⋮ Cube-connected circulants: bisection width, Wiener and forwarding indices ⋮ Forwarding index of cube-connected cycles ⋮ On randomized broadcasting in star graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Forwarding indices of \(k\)-connected graphs
• Edge separators for graphs of bounded genus with applications
• The crossing number of a graph on a compact 2-manifold
• Edge-foreward index of star graphs and other Cayley graphs
• On forwarding indices of networks
• Fast approximation algorithms for multicommodity flow problems
• The forwarding index of directed networks
• The forwarding index of communication networks
• Complexity of the Forwarding Index Problem
• The maximum concurrent flow problem
• The Forwarding Indices of Random Graphs
• On the Complexity of Timetable and Multicommodity Flow Problems
• On stable crossing numbers
• Fast Approximation Schemes for Convex Programs with Many Blocks and Coupling Constraints
• Faster Approximation Algorithms For the Unit Capacity Concurrent Flow Problem with Applications to Routing and Finding Sparse Cuts

This page was built for publication: Constructing integral uniform flows in symmetric networks with application to the edge-forwarding index problem