Shin-ichi NAKAYAMA


A Linear Time Algorithm for Finding a Minimum Spanning Tree with Non-Terminal Set VNT on Outerplanar Graphs
Shin-ichi NAKAYAMA Shigeru MASUYAMA 
Publication:   
Publication Date: 2017/03/01
Vol. E100-D  No. 3  pp. 434-443
Type of Manuscript:  Special Section PAPER (Special Section on Foundations of Computer Science — New Trends in Theoretical Computer Science —)
Category: 
Keyword: 
spanning treeouterplanar graphalgorithm
 Summary | Full Text:PDF(1.1MB)

A Linear Time Algorithm for Finding a Spanning Tree with Non-Terminal Set VNT on Cographs
Shin-ichi NAKAYAMA Shigeru MASUYAMA 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 2016/10/01
Vol. E99-D  No. 10  pp. 2574-2584
Type of Manuscript:  PAPER
Category: Fundamentals of Information Systems
Keyword: 
spanning treecographalgorithm
 Summary | Full Text:PDF(1.5MB)

A Polynomial Time Algorithm for Obtaining a Minimum Vertex Ranking Spanning Tree in Outerplanar Graphs
Shin-ichi NAKAYAMA Shigeru MASUYAMA 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 2006/08/01
Vol. E89-D  No. 8  pp. 2357-2363
Type of Manuscript:  INVITED PAPER (Special Section on Invited Papers from New Horizons in Computing)
Category: 
Keyword: 
algorithmvertex rankingspanning treeouterplanar graph
 Summary | Full Text:PDF(379.8KB)

An Algorithm for Solving the Minimum Vertex Ranking Spanning Tree Problem on Interval Graphs
Shin-ichi NAKAYAMA Shigeru MASUYAMA 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2003/05/01
Vol. E86-A  No. 5  pp. 1019-1026
Type of Manuscript:  Special Section PAPER (Special Section on Discrete Mathematics and Its Applications)
Category: 
Keyword: 
algorithmvertex rankingspanning treeinterval graph
 Summary | Full Text:PDF(301.5KB)

An Algorithm for Finding Two Edge-Disjoint Paths in Tournaments
Shin-ichi NAKAYAMA Shigeru MASUYAMA 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2000/12/25
Vol. E83-A  No. 12  pp. 2672-2678
Type of Manuscript:  PAPER
Category: Algorithms and Data Structures
Keyword: 
edge-disjoint pathtournament graphalgorithm
 Summary | Full Text:PDF(370.2KB)

What Structural Features Make Graph Problems to Have Efficient Parallel Algorithms? --Using Outerplanar Graphs, Trapezoid Graphs and In-Tournament Graphs as Examples--
Shigeru MASUYAMA Shin-ichi NAKAYAMA 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 2000/03/25
Vol. E83-D  No. 3  pp. 541-549
Type of Manuscript:  INVITED SURVEY PAPER
Category: Parallel and Distributed Algorithms
Keyword: 
parallel graph algorithmsstructure and complexityouterplanar graphtrapezoid graphin-tournament graph
 Summary | Full Text:PDF(1.1MB)

Parallel Algorithms for Finding a Hamiltonian Path and a Hamiltonian Cycle in an In-Tournament Graph
Shin-ichi NAKAYAMA Shigeru MASUYAMA 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 1998/05/25
Vol. E81-A  No. 5  pp. 757-767
Type of Manuscript:  Special Section PAPER (Special Section on Discrete Mathematics and Its Applications)
Category: 
Keyword: 
parallel algorithmsHamiltonian pathHamiltonian cyclein-tournament
 Summary | Full Text:PDF(970KB)