On the construction of all shortest node-disjoint paths in star networks

DOI10.1016/j.ipl.2015.11.003zbMath1347.68286OpenAlexW2150740031MaRDI QIDQ903371

Cheng-Nan Lai

Publication date: 5 January 2016

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

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

zbMATH Keywords

maximum matchinginterconnection networksoptimization problemnode-disjoint pathsstar network

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• Node-to-set disjoint paths problem in star graphs
• Embedding longest fault-free paths onto star graphs with more vertex faults
• Longest paths and cycles in faulty star graphs
• A study of fault tolerance in star graph
• One-to-many node-disjoint paths in \((n,k)\)-star graphs
• Disjoint Hamilton cycles in the star graph
• On the construction of all shortest vertex-disjoint paths in Cayley graphs of abelian groups
• Efficient algorithms for finding maximum matching in graphs
• Efficient dispersal of information for security, load balancing, and fault tolerance
• A group-theoretic model for symmetric interconnection networks

This page was built for publication: On the construction of all shortest node-disjoint paths in star networks