|
A Polynomial-Time Algorithm for Finding a Spanning Tree with Non-Terminal Set VNT on Circular-Arc Graphs
Shin-ichi NAKAYAMA Shigeru MASUYAMA | Publication: IEICE TRANSACTIONS on Information and Systems
Publication Date: 2022/08/01
Vol. E105-D
No. 8
pp. 1373-1382
Type of Manuscript:
PAPER
Category: Fundamentals of Information Systems
Keyword:
spanning tree, circular-arc graph, algorithm, | | | Summary | Full Text:PDF | |
|
|
|
|
A Linear-Time Algorithm for Finding a Spanning Tree with Non-Terminal Set VNT on Interval Graphs
Shin-ichi NAKAYAMA Shigeru MASUYAMA | Publication: IEICE TRANSACTIONS on Information and Systems
Publication Date: 2018/09/01
Vol. E101-D
No. 9
pp. 2235-2246
Type of Manuscript:
PAPER
Category: Fundamentals of Information Systems
Keyword:
spanning tree, interval graph, algorithm, | | | Summary | Full Text:PDF | |
|
A Linear Time Algorithm for Finding a Minimum Spanning Tree with Non-Terminal Set VNT on Outerplanar Graphs
Shin-ichi NAKAYAMA Shigeru MASUYAMA | Publication: IEICE TRANSACTIONS on Information and Systems
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 | |
|
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 | |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Multiple Document Summarization System GOLD
Tatsumi YOSHIDA Shigeru MASUYAMA | Publication: IEICE TRANSACTIONS on Information and Systems
Publication Date: 2003/09/01
Vol. E86-D
No. 9
pp. 1719-1727
Type of Manuscript:
Special Section PAPER (Special Issue on Text Processing for Information Access)
Category:
Keyword:
NTCIR, summarization, multiple document, | | | Summary | Full Text:PDF | |
|
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 | |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
The Computational Complexity of the m-Center Problems on the Plane
Shigeru MASUYAMA Toshihide IBARAKI Toshiharu HASEGAWA | Publication: IEICE TRANSACTIONS (1976-1990)
Publication Date: 1981/02/25
Vol. E64-E
No. 2
pp. 57-64
Type of Manuscript:
PAPER
Category: Miscellaneous
Keyword:
| | | Summary | Full Text:PDF | |
|