| Sumio MASUDA
|
|
|
An A* Algorithm with a New Heuristic Distance Function for the 2-Terminal Shortest Path Problem Kazuaki YAMAGUCHI Sumio MASUDA | Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2006/02/01
Vol. E89-A
No. 2
pp. 544-550
Type of Manuscript:
PAPER Category: Algorithms and Data Structures Keyword: shortest path, preprocessing, A* algorithm, routing, | | Summary | Full Text:PDF | |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Algorithms to Obtain a Maximal Planar Hamilton Subgraph Noriya KOBAYASHI Sumio MASUDA Toshinobu KASHIWABARA | Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 1991/04/25
Vol. E74-A
No. 4
pp. 657-664
Type of Manuscript:
Special Section PAPER (Special Issue on Discrete Mathematics and Its Applications) Category: Keyword:
| | Summary | Full Text:PDF | |
|
Finding a Maximal Outerplanar Spanning Subgraph of a Graph Sumio MASUDA Toshinobu KASHIWABARA | Publication: IEICE TRANSACTIONS (1976-1990)
Publication Date: 1990/04/25
Vol. E73-E
No. 4
pp. 532-538
Type of Manuscript:
PAPER Category: Algorithm, Data Structure and Computational Complexity Keyword:
| | Summary | Full Text:PDF | |
|
|