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

DOI10.1016/J.IPL.2015.11.003zbMATH Open1347.68286OpenAlexW2150740031MaRDI QIDQ903371FDOQ903371

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

Recommendations

• On disjoint shortest paths routing in interconnection networks: a case study in the star graph
• scientific article; zbMATH DE number 714464
• On Disjoint Shortest Paths Routing on the Hypercube
• One-to-many node-disjoint paths in \((n,k)\)-star graphs
• Node-to-set disjoint paths problem in star graphs

zbMATH Keywords

node-disjoint pathsinterconnection networksoptimization problemmaximum matchingstar 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

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

Cited In (2)

• Title not available (Why is that?)
• The Number of Shortest Paths in the (n, k)-Star Graphs

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

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