Forwarding and optical indices of a graph

DOI10.1016/J.DAM.2008.03.002zbMath1200.05239OpenAlexW2001614657MaRDI QIDQ1003676

Adrian Kosowski

Publication date: 4 March 2009

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

Full work available at URL: https://doi.org/10.1016/j.dam.2008.03.002

zbMATH Keywords

forwarding indexoptical networkoptical indexall-to-all routingarc forwarding indexdirected optical indexedge forwarding indexundirected optical index

Mathematics Subject Classification ID

Applications of graph theory (05C90) Paths and cycles (05C38) Models of societies, social and urban evolution (91D10)

Related Items (3)

Forwarding and optical indices of 4-regular circulant networks ⋮ The undirected optical indices of complete \(m\)-ary trees ⋮ Recursive cubes of rings as models for interconnection networks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The maximum edge-disjoint paths problem in complete graphs
• Optimal wavelength-routed multicasting
• Expanding and forwarding
• On forwarding indices of networks
• Efficient routing in all-optical networks
• The forwarding index of communication networks
• Complexity of the Forwarding Index Problem
• All-to-all communication for some wavelength-routed all-optical networks
• Forwarding indices of consistent routings and their complexity
• Colouring paths in directed symmetric trees with applications to WDM routing
• On the edge forwarding index problem for small graphs
• Algorithms and Computation
• All-to-all wavelength-routing in all-optical compound networks

This page was built for publication: Forwarding and optical indices of a graph