Node-to-set disjoint paths problem in star graphs

DOI10.1016/S0020-0190(97)00059-8MaRDI QIDQ287065zbMATHOpenAlexFDO

Authors Qian-Ping Gu, Shietung Peng

Publication date 26 May 2016

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

Full work available at URL https://doi.org/10.1016/s0020-0190(97)00059-8

zbMATH Keywords

node-disjoint pathsinterconnection networksstar graphs

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38)

Recommendations

• An efficient algorithm for k-pairwise disjoint paths in star graphs
• One-to-many node-disjoint paths in \((n,k)\)-star graphs
• scientific article; zbMATH DE number 714464
• On strong Menger-connectivity of star graphs
• On the construction of all shortest node-disjoint paths in star networks

Cites work

• scientific article; zbMATH DE number 54299 (Why is no real title available?)
• scientific article; zbMATH DE number 53191 (Why is no real title available?)
• scientific article; zbMATH DE number 714464 (Why is no real title available?)
• A group-theoretic model for symmetric interconnection networks
• Efficient dispersal of information for security, load balancing, and fault tolerance
• Fault tolerance of the star graph interconnection network
• Node-to-node cluster fault tolerant routing in star graphs
• On the fault-diameter of the star graph

Cited in

(11)

• Conditional fault-tolerant routing of \((n,k)\)-star graphs
• Set-to-set disjoint paths in a folded hypercube
• On the construction of all shortest node-disjoint paths in star networks
• Constructing vertex-disjoint paths in \((n, k)\)-star graphs
• scientific article; zbMATH DE number 1696433 (Why is no real title available?)
• Polynomial time algorithm for constructing vertex-disjoint paths in transposition graphs
• scientific article; zbMATH DE number 714464 (Why is no real title available?)
• Short containers in Cayley graphs
• One-to-many node-disjoint paths of hyper-star networks
• One-to-many node-disjoint paths in \((n,k)\)-star graphs
• An efficient algorithm for \(k\)-pairwise disjoint paths in star graphs

This page was built for publication: Node-to-set disjoint paths problem in star graphs

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