Connectivity and constructive algorithms of disjoint paths in dragonfly networks

DOI10.1016/j.tcs.2022.04.028OpenAlexW4293072274MaRDI QIDQ2672591

Jia Yu, Jianxi Fan, Baolei Cheng, Yan Wang, Suying Wu

Publication date: 13 June 2022

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2022.04.028

zbMATH Keywords

connectivityinterconnection networkdisjoint pathdragonfly networks

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (1)

Reliabilities for two kinds of graphs with smaller diameters

Cites Work

• Unnamed Item
• Connectivity of the crossed cube
• Conditional edge-fault Hamiltonian-connectivity of restricted hypercube-like networks
• \(\{2,3\}\)-restricted connectivity of locally twisted cubes
• The spined cube: a new hypercube variant with smaller diameter
• Torus-like graphs and their paired many-to-many disjoint path covers
• The vertex-pancyclicity of data center networks
• Disjoint path covers with path length constraints in restricted hypercube-like graphs
• The locally twisted cubes
• Algorithms and Computation

This page was built for publication: Connectivity and constructive algorithms of disjoint paths in dragonfly networks