Forwarding indices of consistent routings and their complexity

DOI10.1002/NET.3230240204zbMATH Open0804.90041OpenAlexW2095260945MaRDI QIDQ4284078FDOQ4284078

Authors:

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

Recommendations

• Complexity of the Forwarding Index Problem
• scientific article; zbMATH DE number 1034100
• Publication:4205455
• The forwarding indices of graphs -- a survey
• Computation of the forwarding index via flows: A note

zbMATH Keywords

routingedge-forwarding indexvertex-forwarding index

Mathematics Subject Classification ID

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

Cited In (15)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4284078)