Keyword : container problem


Node-to-Node Disjoint Paths Problem in Möbius Cubes
David KOCIK Keiichi KANEKO 
Publication:   
Publication Date: 2017/08/01
Vol. E100-D  No. 8 ; pp. 1837-1843
Type of Manuscript:  PAPER
Category: Dependable Computing
Keyword: 
container problemhypercubemulticomputerinterconnection networkparallel processingdependable computingperformance evaluation
 Summary | Full Text:PDF

An Algorithm for Node-to-Node Disjoint Paths Problem in Burnt Pancake Graphs
Keiichi KANEKO Naoki SAWADA 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 2007/01/01
Vol. E90-D  No. 1 ; pp. 306-313
Type of Manuscript:  PAPER
Category: Dependable Computing
Keyword: 
burnt pancake graphsnode-to-node disjoint paths problemcontainer probleminternally disjoint pathspolynomial time algorithm
 Summary | Full Text:PDF

Internally-Disjoint Paths Problem in Bi-Rotator Graphs
Keiichi KANEKO 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 2005/07/01
Vol. E88-D  No. 7 ; pp. 1678-1684
Type of Manuscript:  PAPER
Category: Dependable Computing
Keyword: 
container probleminternally-disjoint pathsbi-rotator graphsfault toleranceparallel computation
 Summary | Full Text:PDF