Construction algorithm of vertex-disjoint paths in circulant-based recursive networks

DOI10.1007/978-981-96-1093-8_25MaRDI QIDQ6955115zbMATH OpenFDO

Authors Xiaoqing Liu, Hai Liu, Baolei Cheng, Yan Wang, Jianxi Fan

Publication date 23 July 2025

Full work available at URL https://doi.org/10.1007/978-981-96-1093-8_25

zbMATH Keywords

algorithmscirculant-based recursive networksvertex-disjoint paths

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68Rxx)

Cites work

• Connectivity and constructive algorithms of disjoint paths in dragonfly networks
• Disjoint paths and connected subgraphs for \(H\)-free graphs
• Disjoint paths in the enhanced hypercube with a faulty subgraph
• Embedding meshes into twisted-cubes
• Graph theory
• Optimal fault-tolerant embedding of paths in twisted cubes
• The disjoint path cover in the data center network HSDC with prescribed vertices in each path
• Torus-like graphs and their paired many-to-many disjoint path covers

This page was built for publication: Construction algorithm of vertex-disjoint paths in circulant-based recursive networks

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