| 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 tree, outerplanar graph, algorithm, | | 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 tree, cograph, algorithm, | | Summary | Full Text:PDF(1.5MB) | |
|
|
|
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: algorithm, vertex ranking, spanning tree, interval graph, | | Summary | Full Text:PDF(301.5KB) | |
|
|
|
|
|
|
|
|