Node-to-set disjoint paths problem in star graphs

DOI10.1016/S0020-0190(97)00059-8zbMath1337.68206OpenAlexW2023415255MaRDI QIDQ287065

Shietung Peng, Qian-Ping Gu

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

interconnection networksnode-disjoint pathsstar graphs

Mathematics Subject Classification ID

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

Related Items (7)

An efficient algorithm for \(k\)-pairwise disjoint paths in star graphs ⋮ Conditional fault-tolerant routing of (n,k)-star graphs ⋮ On the construction of all shortest node-disjoint paths in star networks ⋮ Constructing vertex-disjoint paths in \((n, k)\)-star graphs ⋮ One-to-many node-disjoint paths in \((n,k)\)-star graphs ⋮ Polynomial time algorithm for constructing vertex-disjoint paths in transposition graphs ⋮ Short containers in Cayley graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the fault-diameter of the star graph
• Fault tolerance of the star graph interconnection network
• Node-to-node cluster fault tolerant routing in star 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: Node-to-set disjoint paths problem in star graphs