An efficient algorithm for k-pairwise disjoint paths in star graphs
From MaRDI portal
Publication:293380
DOI10.1016/S0020-0190(98)00121-5zbMATH Open1339.68205MaRDI QIDQ293380FDOQ293380
Authors: Qian-Ping Gu, Shietung Peng 
Publication date: 9 June 2016
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: http://www.sciencedirect.com/science/article/pii/S0020019098001215?np=y
Recommendations
Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38)
Cites Work
- Title not available (Why is that?)
- A group-theoretic model for symmetric interconnection networks
- Title not available (Why is that?)
- Node-to-node cluster fault tolerant routing in star graphs
- Node-to-set disjoint paths problem in star graphs
- On the existence of certain disjoint arcs in graphs
- On the Computational Complexity of Combinatorial Problems
- Finding Two Disjoint Paths Between Two Pairs of Vertices in a Graph
Cited In (10)
- On the problem of determining which \((n, k)\)-star graphs are Cayley graphs
- Improved algorithms for finding length-bounded two vertex-disjoint paths in a planar graph and minmax \(k\) vertex-disjoint paths in a directed acyclic graph
- Title not available (Why is that?)
- Title not available (Why is that?)
- One-to-many node-disjoint paths in \((n,k)\)-star graphs
- Linearly many faults in Cayley graphs generated by transposition trees
- The Nova Graph: more disjoint paths with minimal graph augmentation
- Set-to-set disjoint paths in a folded hypercube
- On strong Menger-connectivity of star graphs
- Constructing vertex-disjoint paths in \((n, k)\)-star graphs
This page was built for publication: An efficient algorithm for \(k\)-pairwise disjoint paths in star graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q293380)
