|
JAIST Repository >
b. 情報科学研究科・情報科学系 >
b10. 学術雑誌論文等 >
b10-1. 雑誌掲載論文 >
このアイテムの引用には次の識別子を使用してください:
http://hdl.handle.net/10119/9513
|
| タイトル: | Constant-Work-Space Algorithm for a Shortest Path in a Simple Polygon |
| 著者: | Asano, Tetsuo
Mulzer, Wolfgang
Wang, Yajun |
| キーワード: | constant-work-space algorithm
shortest path
simple polygon
simple path in a tree |
| 発行日: | 2010-02-03 |
| 出版者: | Springer |
| 誌名: | Lecture Notes in Computer Science |
| 巻: | 5942/2010 |
| 開始ページ: | 9 |
| 終了ページ: | 20 |
| DOI: | 10.1007/978-3-642-11440-3_2 |
| 抄録: | We present two space-efficient algorithms. First, we show how to report a simple path between two arbitrary nodes in a given tree. Using a technique called “computing instead of storing”, we can design a naive quadratic-time algorithm for the problem using only constant work space, i.e., O(logn) bits in total for the work space, where n is the number of nodes in the tree. Then, another technique “controlled recursion” improves the time bound to O＾(n 1 + ε ) for any positive constant ε. Second, we describe how to compute a shortest path between two points in a simple n-gon. Although the shortest path problem in general graphs is NL-complete, this constrained problem can be solved in quadratic time using only constant work space. |
| Rights: | This is the author-created version of Springer, Tetsuo Asano, Wolfgang Mulzer and Yajun Wang, Lecture Notes in Computer Science, 5942/2010, 2010, 9-20. The original publication is available at www.springerlink.com, http://dx.doi.org/10.1007/978-3-642-11440-3_2 |
| URI: | http://hdl.handle.net/10119/9513 |
| 資料タイプ: | author |
| 出現コレクション: | b10-1. 雑誌掲載論文 (Journal Articles)
|
このアイテムのファイル:
| ファイル |
記述 |
サイズ | 形式 |
|---|
| 15868-1.pdf | | 169Kb | Adobe PDF | 見る/開く |
|
当システムに保管されているアイテムはすべて著作権により保護されています。
|
