WEKO3
インデックスリンク
アイテム
{"_buckets": {"deposit": "7945cfe4-cd48-490d-848b-d9c57f9c8e4a"}, "_deposit": {"created_by": 18, "id": "56526", "owners": [18], "pid": {"revision_id": 0, "type": "depid", "value": "56526"}, "status": "published"}, "_oai": {"id": "oai:kanazawa-u.repo.nii.ac.jp:00056526", "sets": ["936"]}, "author_link": ["99048", "99049", "97040"], "item_4_biblio_info_8": {"attribute_name": "書誌情報", "attribute_value_mlt": [{"bibliographicIssueDates": {"bibliographicIssueDate": "2011", "bibliographicIssueDateType": "Issued"}, "bibliographicIssueNumber": "5", "bibliographicPageEnd": "586", "bibliographicPageStart": "569", "bibliographicVolumeNumber": "15", "bibliographic_titles": [{"bibliographic_title": "Journal of Graph Algorithms and Applications"}]}]}, "item_4_creator_33": {"attribute_name": "著者別表示", "attribute_type": "creator", "attribute_value_mlt": [{"creatorNames": [{"creatorName": "浅野, 哲夫"}], "nameIdentifiers": [{"nameIdentifier": "97040", "nameIdentifierScheme": "WEKO"}, {"nameIdentifier": "90113133", "nameIdentifierScheme": "e-Rad", "nameIdentifierURI": "https://kaken.nii.ac.jp/ja/search/?qm=90113133"}]}]}, "item_4_description_21": {"attribute_name": "抄録", "attribute_value_mlt": [{"subitem_description": "Constant-work-space algorithms model computation when space is at a premium: the input is given as a read-only array that allows random ac- cess to its entries, and the algorithm may use constantly many additional registers of O(logn) bits each, where n denotes the input size. We present such algorithms for two restricted variants of the shortest path problem. First, we describe how to report a simple path between two arbitrary nodes in a given tree. Using a technique called \"computing instead of storing\", we obtain a naive algorithm that needs quadratic time and a constant number of additional registers. We then show how to improve the running time to linear by applying a technique named \"simulated parallelization\". Second, we show how to compute a shortest geodesic path between two points in a simple polygon in quadratic time and with constant work-space.", "subitem_description_type": "Abstract"}]}, "item_4_description_5": {"attribute_name": "提供者所属", "attribute_value_mlt": [{"subitem_description": "金沢大学", "subitem_description_type": "Other"}]}, "item_4_identifier_registration": {"attribute_name": "ID登録", "attribute_value_mlt": [{"subitem_identifier_reg_text": "10.24517/00062800", "subitem_identifier_reg_type": "JaLC"}]}, "item_4_publisher_17": {"attribute_name": "出版者", "attribute_value_mlt": [{"subitem_publisher": "Brown University"}]}, "item_4_relation_12": {"attribute_name": "DOI", "attribute_value_mlt": [{"subitem_relation_type": "isIdenticalTo", "subitem_relation_type_id": {"subitem_relation_type_id_text": "10.7155/jgaa.00240", "subitem_relation_type_select": "DOI"}}]}, "item_4_relation_28": {"attribute_name": "関連URI", "attribute_value_mlt": [{"subitem_relation_name": [{"subitem_relation_name_text": "https://www.brown.edu/"}], "subitem_relation_type_id": {"subitem_relation_type_id_text": "https://www.brown.edu/", "subitem_relation_type_select": "URI"}}, {"subitem_relation_name": [{"subitem_relation_name_text": "http://jgaa.info/getPaper?id=240"}], "subitem_relation_type_id": {"subitem_relation_type_id_text": "http://jgaa.info/getPaper?id=240", "subitem_relation_type_select": "URI"}}]}, "item_4_rights_23": {"attribute_name": "権利", "attribute_value_mlt": [{"subitem_rights": "Copyright © Brown University, Journal of Graph Algorithms and Applications"}]}, "item_4_source_id_9": {"attribute_name": "ISSN", "attribute_value_mlt": [{"subitem_source_identifier": "1526-1719", "subitem_source_identifier_type": "ISSN"}]}, "item_4_version_type_25": {"attribute_name": "著者版フラグ", "attribute_value_mlt": [{"subitem_version_resource": "http://purl.org/coar/version/c_970fb48d4fbd8a85", "subitem_version_type": "VoR"}]}, "item_creator": {"attribute_name": "著者", "attribute_type": "creator", "attribute_value_mlt": [{"creatorNames": [{"creatorName": "Asano, Tetsuo"}], "nameIdentifiers": [{"nameIdentifier": "97040", "nameIdentifierScheme": "WEKO"}, {"nameIdentifier": "90113133", "nameIdentifierScheme": "e-Rad", "nameIdentifierURI": "https://kaken.nii.ac.jp/ja/search/?qm=90113133"}]}, {"creatorNames": [{"creatorName": "Mulzer, Wolfgang"}], "nameIdentifiers": [{"nameIdentifier": "99048", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "Wang, Yajun"}], "nameIdentifiers": [{"nameIdentifier": "99049", "nameIdentifierScheme": "WEKO"}]}]}, "item_files": {"attribute_name": "ファイル情報", "attribute_type": "file", "attribute_value_mlt": [{"accessrole": "open_date", "date": [{"dateType": "Available", "dateValue": "2021-07-05"}], "displaytype": "detail", "download_preview_message": "", "file_order": 0, "filename": "TE-PR-ASANO-T-569.pdf", "filesize": [{"value": "1.6 MB"}], "format": "application/pdf", "future_date_message": "", "is_thumbnail": false, "licensetype": "license_11", "mimetype": "application/pdf", "size": 1600000.0, "url": {"label": "TE-PR-ASANO-T-569.pdf", "url": "https://kanazawa-u.repo.nii.ac.jp/record/56526/files/TE-PR-ASANO-T-569.pdf"}, "version_id": "f69ff509-e1ae-42f2-8e3f-8f9249164be3"}]}, "item_language": {"attribute_name": "言語", "attribute_value_mlt": [{"subitem_language": "eng"}]}, "item_resource_type": {"attribute_name": "資源タイプ", "attribute_value_mlt": [{"resourcetype": "journal article", "resourceuri": "http://purl.org/coar/resource_type/c_6501"}]}, "item_title": "Constant-work-space algorithms for shortest paths in trees and simple polygons", "item_titles": {"attribute_name": "タイトル", "attribute_value_mlt": [{"subitem_title": "Constant-work-space algorithms for shortest paths in trees and simple polygons"}]}, "item_type_id": "4", "owner": "18", "path": ["936"], "permalink_uri": "https://doi.org/10.24517/00062800", "pubdate": {"attribute_name": "公開日", "attribute_value": "2021-07-05"}, "publish_date": "2021-07-05", "publish_status": "0", "recid": "56526", "relation": {}, "relation_version_is_last": true, "title": ["Constant-work-space algorithms for shortest paths in trees and simple polygons"], "weko_shared_id": -1}
Constant-work-space algorithms for shortest paths in trees and simple polygons
https://doi.org/10.24517/00062800
https://doi.org/10.24517/000628001e688c62-8c97-42b9-8548-ca7ec917729e
名前 / ファイル | ライセンス | アクション |
---|---|---|
TE-PR-ASANO-T-569.pdf (1.6 MB)
|
Item type | 学術雑誌論文 / Journal Article(1) | |||||
---|---|---|---|---|---|---|
公開日 | 2021-07-05 | |||||
タイトル | ||||||
タイトル | Constant-work-space algorithms for shortest paths in trees and simple polygons | |||||
言語 | ||||||
言語 | eng | |||||
資源タイプ | ||||||
資源タイプ識別子 | http://purl.org/coar/resource_type/c_6501 | |||||
資源タイプ | journal article | |||||
ID登録 | ||||||
ID登録 | 10.24517/00062800 | |||||
ID登録タイプ | JaLC | |||||
著者 |
Asano, Tetsuo
× Asano, Tetsuo× Mulzer, Wolfgang× Wang, Yajun |
|||||
著者別表示 |
浅野, 哲夫
× 浅野, 哲夫 |
|||||
提供者所属 | ||||||
内容記述タイプ | Other | |||||
内容記述 | 金沢大学 | |||||
書誌情報 |
Journal of Graph Algorithms and Applications 巻 15, 号 5, p. 569-586, 発行日 2011 |
|||||
ISSN | ||||||
収録物識別子タイプ | ISSN | |||||
収録物識別子 | 1526-1719 | |||||
DOI | ||||||
関連タイプ | isIdenticalTo | |||||
識別子タイプ | DOI | |||||
関連識別子 | 10.7155/jgaa.00240 | |||||
出版者 | ||||||
出版者 | Brown University | |||||
抄録 | ||||||
内容記述タイプ | Abstract | |||||
内容記述 | Constant-work-space algorithms model computation when space is at a premium: the input is given as a read-only array that allows random ac- cess to its entries, and the algorithm may use constantly many additional registers of O(logn) bits each, where n denotes the input size. We present such algorithms for two restricted variants of the shortest path problem. First, we describe how to report a simple path between two arbitrary nodes in a given tree. Using a technique called "computing instead of storing", we obtain a naive algorithm that needs quadratic time and a constant number of additional registers. We then show how to improve the running time to linear by applying a technique named "simulated parallelization". Second, we show how to compute a shortest geodesic path between two points in a simple polygon in quadratic time and with constant work-space. | |||||
権利 | ||||||
権利情報 | Copyright © Brown University, Journal of Graph Algorithms and Applications | |||||
著者版フラグ | ||||||
出版タイプ | VoR | |||||
出版タイプResource | http://purl.org/coar/version/c_970fb48d4fbd8a85 | |||||
関連URI | ||||||
識別子タイプ | URI | |||||
関連識別子 | https://www.brown.edu/ | |||||
関連名称 | https://www.brown.edu/ | |||||
関連URI | ||||||
識別子タイプ | URI | |||||
関連識別子 | http://jgaa.info/getPaper?id=240 | |||||
関連名称 | http://jgaa.info/getPaper?id=240 |