WEKO3
アイテム
可変優先キューとその応用
https://ipsj.ixsq.nii.ac.jp/records/24912
https://ipsj.ixsq.nii.ac.jp/records/2491212cef9f5-20fd-482d-bfd8-77e9f0bd0b1c
名前 / ファイル | ライセンス | アクション |
---|---|---|
![]() |
Copyright (c) 1986 by the Information Processing Society of Japan
|
|
オープンアクセス |
Item type | SIG Technical Reports(1) | |||||||
---|---|---|---|---|---|---|---|---|
公開日 | 1986-11-20 | |||||||
タイトル | ||||||||
タイトル | 可変優先キューとその応用 | |||||||
タイトル | ||||||||
言語 | en | |||||||
タイトル | A Variable Priority Queue and its Applications | |||||||
言語 | ||||||||
言語 | jpn | |||||||
資源タイプ | ||||||||
資源タイプ識別子 | http://purl.org/coar/resource_type/c_18gh | |||||||
資源タイプ | technical report | |||||||
著者所属 | ||||||||
東北大学工学部通信工学科 | ||||||||
著者所属 | ||||||||
東北大学工学部通信工学科 | ||||||||
著者所属 | ||||||||
東北大学工学部通信工学科 | ||||||||
著者所属(英) | ||||||||
en | ||||||||
Department of Electrical Communications, Faculty of Engineering, Tohoku University | ||||||||
著者所属(英) | ||||||||
en | ||||||||
Department of Electrical Communications, Faculty of Engineering, Tohoku University | ||||||||
著者所属(英) | ||||||||
en | ||||||||
Department of Electrical Communications, Faculty of Engineering, Tohoku University | ||||||||
著者名 |
鈴木, 均
× 鈴木, 均
|
|||||||
著者名(英) |
Hitoshi, Suzuki
× Hitoshi, Suzuki
|
|||||||
論文抄録 | ||||||||
内容記述タイプ | Other | |||||||
内容記述 | This paper proposes a new data structure called a "variable priority queue". The queue supports in addition to the ordinary queue operations an operation MIN to find an item of minimum key and operations to change keys of items. Any sequence of these m operations can be processed in O(m) time. The variable priority queue is useful in designing efficient algorithms for various network problems such as the multicommodity flow and edge-disjoint path problems on planar graphs. | |||||||
論文抄録(英) | ||||||||
内容記述タイプ | Other | |||||||
内容記述 | This paper proposes a new data structure called a "variable priority queue". The queue supports, in addition to the ordinary queue operations, an operation MIN to find an item of minimum key and operations to change keys of items. Any sequence of these m operations can be processed in O(m) time. The variable priority queue is useful in designing efficient algorithms for various network problems such as the multicommodity flow and edge-disjoint path problems on planar graphs. | |||||||
書誌レコードID | ||||||||
収録物識別子タイプ | NCID | |||||||
収録物識別子 | AN10096105 | |||||||
書誌情報 |
情報処理学会研究報告計算機アーキテクチャ(ARC) 巻 1986, 号 77(1986-ARC-063), p. 141-151, 発行日 1986-11-20 |
|||||||
Notice | ||||||||
SIG Technical Reports are nonrefereed and hence may later appear in any journals, conferences, symposia, etc. | ||||||||
出版者 | ||||||||
言語 | ja | |||||||
出版者 | 情報処理学会 |