Disjoint Paths Routing in Pancake Graphs

@article{Kaneko2006DisjointPR,
  title={Disjoint Paths Routing in Pancake Graphs},
  author={Keiichi Kaneko and Shietung Peng},
  journal={2006 Seventh International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT'06)},
  year={2006},
  pages={254-259}
}
  • K. Kaneko, S. Peng
  • Published 4 December 2006
  • Computer Science, Mathematics
  • 2006 Seventh International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT'06)
In this paper, we propose efficient algorithms that find disjoint paths for node-to-node and node-to-set routing in pancake graphs. For an n-pancake graph, the algorithms can find n - 1 disjoint paths of small maximum length with optimal time complexity. That is, the n - 1 paths can be constructed in O(n2) time and the maximum length is bounded by 5n/3 + 6 

Figures and Tables from this paper

Set-to-Set Disjoint Paths Routing in Dual-Cubes
  • K. Kaneko, S. Peng
  • Computer Science
    2008 Ninth International Conference on Parallel and Distributed Computing, Applications and Technologies
  • 2008
TLDR
An efficient algorithm that finds disjoint paths for set-to-set routing in a dual-cube with about half of links per node compared with the hypercube containing equal number of nodes is proposed.
Fault-Tolerant Routing in (n, k) - Star Graphs
TLDR
A fault-tolerant routing algorithm is proposed that establishes a fault-free path between any pair of non-faulty nodes in an Sn, k with faulty nodes by using limited global information called safety vectors.
The Set-to-Set Disjoint-Path Problem in Perfect Hierarchical Hypercubes
TLDR
An algorithm solving the set-to-set disjoint-path routing problem in perfect HHCs is described, which can find m+1 node-disjoint paths between the nodes of S and the node of D of lengths at most in O(m2 22m) time complexity.
A routing algorithm of pairwise disjoint paths in a burnt pancake graph
TLDR
An algorithm that solves the k-pariwise disjoint path problem in an n-burnt pancake graph in polynomial-order time of <i>n</i> is proposed and a proof of its correctness is given.
Vertex-disjoint paths in DCell networks
A Set-to-Set Disjoint Paths Routing Algorithm in Tori
TLDR
It is proved that the paths selected by the proposed algorithm have lengths at most 2( k +1) n  and can be obtained with a time complexity of O ( kn 3 n 3 log n ).
The constructive algorithm of vertex-disjoint paths in the generalized hypercube under restricted connectivity
TLDR
An algorithm is designed to construct at least k^1(G) disjoint paths based on any two distinct vertices in G(m, m_r-1,...,m_1) under the 1-restricted connectivity.
Constructing Independent Spanning Trees on Pancake Networks
TLDR
This paper proposes algorithms for constructing ISTs on pancake graph and presents proofs about the construction of ISTs in different dimensions to verify that the correctness of these algorithms are correct.
Mutually Independent Hamiltonian Cycle of Burnt Pancake Graphs
TLDR
This paper proved that IHC (B2)=1 and IHC(Bn)=n for n≥3 and that the mutually independent hamiltonicity of a graph G is the maximum integer k such that for any vertex u of G there are k mutually independent Hamiltonian cycles of G starting at u.
Set-to-Set Disjoint Paths in Tori
  • K. Kaneko, A. Bossard
  • Computer Science
    2016 Fourth International Symposium on Computing and Networking (CANDAR)
  • 2016
TLDR
This paper proposes an algorithm that constructs 2n mutually node-disjoint paths from a set S of 2n source nodes to a set D of2n destination nodes in an n-dimensional k-ary torus Tn,k (n¡Ã 1, k ¡Ã 3).
...
1
2
...

References

SHOWING 1-10 OF 21 REFERENCES
An Algorithm for Node-Disjoint Paths in Pancake Graphs
TLDR
An algorithm for construction of n internally disjoint paths connecting the nodes in the time complexity of polynomial order of n for any pair of distinct nodes in an n-pancake graph is given.
Node-to-set disjoint paths problem in pancake graphs
TLDR
The algorithm is of polynomial order of n for an n-pancake graph and divided into two cases according to the distribution of destination nodes in classes into which all the nodes in a pancake graph are categorized.
Node-to-Set Disjoint Paths Problem in Burnt Pancake Graphs
  • K. Kaneko
  • Computer Science, Mathematics
    SNPD
  • 2003
TLDR
This study focuses on n-burnt pancake graphs and proposes an algorithm to obtain n disjoint paths from a source node to n destination nodes in polynomial order time of n, n being the degree of the graph.
An Algorithm for Node-to-Set Disjoint Paths Problem in Bi-Rotator Graphs
  • K. Kaneko
  • Computer Science
    IEICE Trans. Inf. Syst.
  • 2006
TLDR
An algorithm is described for solving the node-to-set disjoint paths problem in bi-rotator graphs, which are obtained by making each edge of a rotator graph bi-directional, based on recursion and divided into three cases according to the distribution of destination nodes in the classes into which the nodes in a bi- rotateator graph are categorized.
Container Problem in Burnt Pancake Graphs
TLDR
An algorithm that solves the container problem in n-burnt pancake graphs in polynomial order time of n is proposed and its correctness is proved and estimates of time complexity and sum of paths lengths are given.
Node-to-node internally disjoint paths problem in bubble-sort graphs
  • K. Kaneko, Yasuto Suzuki
  • Computer Science
    10th IEEE Pacific Rim International Symposium on Dependable Computing, 2004. Proceedings.
  • 2004
TLDR
This work proposes an algorithm to obtain n-1 disjoint paths between arbitrary two nodes in the complexity of polynomial order of n which is the degree of the graph plus one.
Node-To-Set Disjoint Paths Problem in Star Graphs
  • Q. Gu, S. Peng
  • Mathematics, Computer Science
    Inf. Process. Lett.
  • 1997
On the Fault-Diameter of the Star Graph
  • S. Latifi
  • Computer Science
    Inf. Process. Lett.
  • 1993
Rotator Graphs: An Efficient Topology for Point-to-Point Multiprocessor Networks
  • P. Corbett
  • Mathematics
    IEEE Trans. Parallel Distributed Syst.
  • 1992
TLDR
The n-rotator graphs are shown to be optimally fault tolerant and maximally one-step fault diagnosable, and an algorithm for finding a Hamiltonian circuit in the graphs is given.
...
1
2
3
...