The optimal routing of augmented cubes

DOI10.1016/J.IPL.2018.04.003MaRDI QIDQ1751422zbMATH OpenOpenAlexWikidataFDO

Authors Meirun Chen, Reza Naserasr

Publication date 25 May 2018

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ipl.2018.04.003

zbMATH Keywords

interconnection networksoptimal routingaugmented cubesedge forwarding indexHMS-routing

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• The forwarding indices of augmented cubes
• Forwarding indices of folded \(n\)-cubes
• Augmented cubes
• The forwarding indices of graphs -- a survey
• Forwarding index of cube-connected cycles

Cites work

• Augmented cubes
• Edge-foreward index of star graphs and other Cayley graphs
• On forwarding indices of networks
• The forwarding indices of augmented cubes
• The minimum-length generator sequence problem is NP-hard

Cited in

(4)

• The forwarding indices of augmented cubes
• Distance and Short Parallel Paths in Augmented Cubes
• Component connectivity of augmented cubes
• Congestion-free Optimal Routings of Hypercube Automorphisms

This page was built for publication: The optimal routing of augmented cubes

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