The forwarding index of directed networks

DOI10.1016/0166-218X(95)00072-YzbMath0859.05048WikidataQ126551389 ScholiaQ126551389MaRDI QIDQ1923618

Zsolt Tuza, Yannis Manoussakis

Publication date: 9 October 1996

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

Full work available at URL: http://www.elsevier.com/locate/dam

zbMATH Keywords

paths; digraph; connectivity; routing; forwarding index

Mathematics Subject Classification ID

05C38: Paths and cycles

05C20: Directed graphs (digraphs), tournaments

05C40: Connectivity

Related Items

Unnamed Item, Constructing integral uniform flows in symmetric networks with application to the edge-forwarding index problem, Echo: a peer-to-peer clustering framework for improving communication in DHTs, The forwarding indices of augmented cubes, On \(f\)-fault tolerant arc-forwarding and optical indices of all-optical folded hypercubes, The forwarding index of communication networks with given connectivity, Forwarding indices of folded \(n\)-cubes, Directed virtual path layouts in ATM networks, Metaheuristics for computing the forwarding index of a graph*

Cites Work

• Unnamed Item
• The forwarding index of communication networks with given connectivity
• Forwarding indices of \(k\)-connected graphs
• On forwarding indices of networks
• Upper bounds for the forwarding indices of communication networks
• The forwarding index of communication networks
• Complexity of the Forwarding Index Problem
• Computation of the forwarding index via flows: A note