WEKO3
インデックスリンク
アイテム
Efficient Enumeration of All Ladder Lotteries with k Bars
https://iwate-u.repo.nii.ac.jp/records/10348
https://iwate-u.repo.nii.ac.jp/records/1034805391201-ecf0-4f64-9f1e-0649162d6c04
| 名前 / ファイル | ライセンス | アクション |
|---|---|---|
ieicet-ve97-an6p1163-1170.pdf (734.7 kB)
|
|
| Item type | 学術雑誌論文 / Journal Article(1) | |||||||||
|---|---|---|---|---|---|---|---|---|---|---|
| 公開日 | 2014-09-25 | |||||||||
| タイトル | ||||||||||
| タイトル | Efficient Enumeration of All Ladder Lotteries with k Bars | |||||||||
| 言語 | ||||||||||
| 言語 | eng | |||||||||
| キーワード | ||||||||||
| 主題Scheme | Other | |||||||||
| 主題 | algorithm | |||||||||
| キーワード | ||||||||||
| 主題Scheme | Other | |||||||||
| 主題 | enumeration | |||||||||
| キーワード | ||||||||||
| 主題Scheme | Other | |||||||||
| 主題 | ladder lottery | |||||||||
| キーワード | ||||||||||
| 主題Scheme | Other | |||||||||
| 主題 | family tree | |||||||||
| 資源タイプ | ||||||||||
| 資源タイプ識別子 | http://purl.org/coar/resource_type/c_6501 | |||||||||
| 資源タイプ | journal article | |||||||||
| 著者 |
YAMANAKA, Katsuhisa
× YAMANAKA, Katsuhisa
× NAKANO, Shin-ichi
|
|||||||||
| 著者(機関) | ||||||||||
| 値 | Department of Electrical Engineering and Computer Science, Iwate University | |||||||||
| 著者(機関) | ||||||||||
| 値 | Department of Computer Science, Gunma University | |||||||||
| 登録日 | ||||||||||
| 日付 | 2014-09-25 | |||||||||
| 書誌情報 |
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences 巻 E97-A, 号 6, p. 1163-1170, 発行日 2014-06-01 |
|||||||||
| ISSN | ||||||||||
| 収録物識別子タイプ | ISSN | |||||||||
| 収録物識別子 | 0916-8508 | |||||||||
| Abstract | ||||||||||
| 内容記述タイプ | Other | |||||||||
| 内容記述 | A ladder lottery, known as the “Amidakuji” in Japan, is a network with n vertical lines and many horizontal lines each of which connects two consecutive vertical lines. Each ladder lottery corresponds to a permutation. Ladder lotteries are frequently used as natural models in many areas. Given a permutation π, an algorithm to enumerate all ladder lotteries of π with the minimum number of horizontal lines is known. In this paper, given a permutation π and an integer k, we design an algorithm to enumerate all ladder lotteries of π with exactly k horizontal lines. | |||||||||
| 出版者 | ||||||||||
| 出版者 | The Institute of Electronics, Information and Communication Engineers | |||||||||
| 権利 | ||||||||||
| 権利情報 | Copyright (c) 2014 The Institute of Electronics, Information and Communication Engineers | |||||||||
| DOI | ||||||||||
| 関連タイプ | isIdenticalTo | |||||||||
| 識別子タイプ | DOI | |||||||||
| 関連識別子 | 10.1587/transfun.E97.A.1163 | |||||||||
| 著者版フラグ | ||||||||||
| 出版タイプ | VoR | |||||||||
| 出版タイプResource | http://purl.org/coar/version/c_970fb48d4fbd8a85 | |||||||||
