Paper Abstract and Keywords |
Presentation |
2012-03-16 14:10
Sublinear Space Algorithm for Shortest Path Problem on Grid Graph Tatsuya Imai, Shunsuke Noguchi, Tetsuro Fuji (Titech) COMP2011-52 |
Abstract |
(in Japanese) |
(See Japanese page) |
(in English) |
The shortest path problem is one of the most important problem in computer science and has many practical applications, although many shortest path algorithms proposed in previous work need memory space which is proportional to the number of vertices in the graph. In this paper, we propose a sublinear space algorithm computing a shortest path between two vertices in a grid graph. This algorithm uses $O(\frac{n^{2^l}}{2^{l+1}-1})$ words and runs in $O(n^{\frac{2^l (l+2)}{2^{l+1}-1}})$ time where $n$ is the number of vertices and $l$ is a parameter. |
Keyword |
(in Japanese) |
(See Japanese page) |
(in English) |
shortest path problem / grid graph / Dijkstra's Algorithm / space complexity / sublinear space / / / |
Reference Info. |
IEICE Tech. Rep., vol. 111, no. 494, COMP2011-52, pp. 39-44, March 2012. |
Paper # |
COMP2011-52 |
Date of Issue |
2012-03-09 (COMP) |
ISSN |
Print edition: ISSN 0913-5685 Online edition: ISSN 2432-6380 |
Copyright and reproduction |
All rights are reserved and no part of this publication may be reproduced or transmitted in any form or by any means, electronic or mechanical, including photocopy, recording, or any information storage and retrieval system, without permission in writing from the publisher. Notwithstanding, instructors are permitted to photocopy isolated articles for noncommercial classroom use without fee. (License No.: 10GA0019/12GB0052/13GB0056/17GB0034/18GB0034) |
Download PDF |
COMP2011-52 |
Conference Information |
Committee |
COMP |
Conference Date |
2012-03-16 - 2012-03-16 |
Place (in Japanese) |
(See Japanese page) |
Place (in English) |
Univ. of Tokyo |
Topics (in Japanese) |
(See Japanese page) |
Topics (in English) |
|
Paper Information |
Registration To |
COMP |
Conference Code |
2012-03-COMP |
Language |
Japanese |
Title (in Japanese) |
(See Japanese page) |
Sub Title (in Japanese) |
(See Japanese page) |
Title (in English) |
Sublinear Space Algorithm for Shortest Path Problem on Grid Graph |
Sub Title (in English) |
|
Keyword(1) |
shortest path problem |
Keyword(2) |
grid graph |
Keyword(3) |
Dijkstra's Algorithm |
Keyword(4) |
space complexity |
Keyword(5) |
sublinear space |
Keyword(6) |
|
Keyword(7) |
|
Keyword(8) |
|
1st Author's Name |
Tatsuya Imai |
1st Author's Affiliation |
Tokyo Institute of Technology (Titech) |
2nd Author's Name |
Shunsuke Noguchi |
2nd Author's Affiliation |
Tokyo Institute of Technology (Titech) |
3rd Author's Name |
Tetsuro Fuji |
3rd Author's Affiliation |
Tokyo Institute of Technology (Titech) |
4th Author's Name |
|
4th Author's Affiliation |
() |
5th Author's Name |
|
5th Author's Affiliation |
() |
6th Author's Name |
|
6th Author's Affiliation |
() |
7th Author's Name |
|
7th Author's Affiliation |
() |
8th Author's Name |
|
8th Author's Affiliation |
() |
9th Author's Name |
|
9th Author's Affiliation |
() |
10th Author's Name |
|
10th Author's Affiliation |
() |
11th Author's Name |
|
11th Author's Affiliation |
() |
12th Author's Name |
|
12th Author's Affiliation |
() |
13th Author's Name |
|
13th Author's Affiliation |
() |
14th Author's Name |
|
14th Author's Affiliation |
() |
15th Author's Name |
|
15th Author's Affiliation |
() |
16th Author's Name |
|
16th Author's Affiliation |
() |
17th Author's Name |
|
17th Author's Affiliation |
() |
18th Author's Name |
|
18th Author's Affiliation |
() |
19th Author's Name |
|
19th Author's Affiliation |
() |
20th Author's Name |
|
20th Author's Affiliation |
() |
Speaker |
Author-3 |
Date Time |
2012-03-16 14:10:00 |
Presentation Time |
35 minutes |
Registration for |
COMP |
Paper # |
COMP2011-52 |
Volume (vol) |
vol.111 |
Number (no) |
no.494 |
Page |
pp.39-44 |
#Pages |
6 |
Date of Issue |
2012-03-09 (COMP) |