Node-to-set disjoint paths problem in star graphs
From MaRDI portal
Publication:287065
DOI10.1016/S0020-0190(97)00059-8zbMATH Open1337.68206OpenAlexW2023415255MaRDI QIDQ287065FDOQ287065
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
Recommendations
Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38)
Cites Work
- A group-theoretic model for symmetric interconnection networks
- Title not available (Why is that?)
- Title not available (Why is that?)
- 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
- Title not available (Why is that?)
Cited In (11)
- Title not available (Why is that?)
- Short containers in Cayley graphs
- An efficient algorithm for \(k\)-pairwise disjoint paths in star graphs
- One-to-many node-disjoint paths in \((n,k)\)-star graphs
- One-to-many node-disjoint paths of hyper-star networks
- On the construction of all shortest node-disjoint paths in star networks
- Set-to-set disjoint paths in a folded hypercube
- Title not available (Why is that?)
- Constructing vertex-disjoint paths in \((n, k)\)-star graphs
- Polynomial time algorithm for constructing vertex-disjoint paths in transposition graphs
- Conditional fault-tolerant routing of \((n,k)\)-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)
