Yasuto SUZUKI


The Container Problem in Bubble-Sort Graphs
Yasuto SUZUKI Keiichi KANEKO 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 2008/04/01
Vol. E91-D  No. 4  pp. 1003-1009
Type of Manuscript:  PAPER
Category: Algorithm Theory
Keyword: 
bubble-sort graphsinternally disjoint pathspolynomial algorithmfault tolerance
 Summary | Full Text:PDF

Node-Disjoint Paths Algorithm in a Transposition Graph
Yasuto SUZUKI Keiichi KANEKO Mario NAKAMORI 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 2006/10/01
Vol. E89-D  No. 10  pp. 2600-2605
Type of Manuscript:  PAPER
Category: Algorithm Theory
Keyword: 
interconnection networksgraph algorithmstransposition graphsnode-to-set disjoint pathsparallel computing
 Summary | Full Text:PDF

Node-to-Set Disjoint Paths Problem in Pancake Graphs
Keiichi KANEKO Yasuto SUZUKI 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 2003/09/01
Vol. E86-D  No. 9  pp. 1628-1633
Type of Manuscript:  Special Section PAPER (Special Issue on Parallel and Distributed Computing, Applications and Technologies)
Category: Algorithms and Applications
Keyword: 
interconnection networksgraph algorithmspancake graphnode-to-set disjoint pathsparallel computing
 Summary | Full Text:PDF

Minimum Feedback Node Sets in Trivalent Cayley Graphs
Yasuto SUZUKI Keiichi KANEKO 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 2003/09/01
Vol. E86-D  No. 9  pp. 1634-1636
Type of Manuscript:  Special Section LETTER (Special Issue on Parallel and Distributed Computing, Applications and Technologies)
Category: 
Keyword: 
feedback node settrivalent Cayley graphsinterconnection networks
 Summary | Full Text:PDF

An Algorithm for Node-Disjoint Paths in Pancake Graphs
Yasuto SUZUKI Keiichi KANEKO 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 2003/03/01
Vol. E86-D  No. 3  pp. 610-615
Type of Manuscript:  PAPER
Category: Algorithms
Keyword: 
pancake graphsnode-to-node disjoint paths probleminterconnection networksparallel and distributed processing
 Summary | Full Text:PDF

An Algorithm for Node-to-Set Disjoint Paths Problem in Rotator Graphs
Keiichi KANEKO Yasuto SUZUKI 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 2001/09/01
Vol. E84-D  No. 9  pp. 1155-1163
Type of Manuscript:  PAPER
Category: Algorithms
Keyword: 
rotator graphsnode-to-set disjoint paths probleminterconnection networkparallel and distributed processing
 Summary | Full Text:PDF