WEKO3
アイテム
Counting the Number of Paths in a Graph via BDDs
http://hdl.handle.net/2261/00074080
http://hdl.handle.net/2261/00074080d46a57a7-8771-4b5b-9f52-d0a9ee982b31
| 名前 / ファイル | ライセンス | アクション |
|---|---|---|
Counting the Number of Paths in a Graph via BDDs 1997.pdf (635.5 kB)
|
|
| Item type | 学術雑誌論文 / Journal Article(1) | |||||
|---|---|---|---|---|---|---|
| 公開日 | 2017-12-14 | |||||
| タイトル | ||||||
| タイトル | Counting the Number of Paths in a Graph via BDDs | |||||
| 言語 | ||||||
| 言語 | eng | |||||
| 資源タイプ | ||||||
| 資源 | http://purl.org/coar/resource_type/c_6501 | |||||
| タイプ | journal article | |||||
| 著者 |
SEKINE, Kyoko
× SEKINE, Kyoko× IMAI, Hiroshi |
|||||
| 著者所属 | ||||||
| 著者所属 | Department of Information Science, University of Tokyo | |||||
| 抄録 | ||||||
| 内容記述タイプ | Abstract | |||||
| 内容記述 | This paper proposes a unified approach by means of the binary decision diagram, BDD in short, to solve #P-hand problems of counting the number of paths between two terminals in undirected and directed graphs. Our approach provides algorithms running in O (2O (√n) ) time for typical planar graphs such as grid graphs. In fact, for any class of graphs having a good elimination ordering, this paradigm provides efficient solutions. | |||||
| 内容記述 | ||||||
| 内容記述タイプ | Other | |||||
| 内容記述 | Special Section PAPER (Special Section on Discrete Mathematics and Its Applications) | |||||
| 書誌情報 |
IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences 巻 E80-A, 号 4, p. 682-688, 発行日 1997-04-25 |
|||||
| 権利 | ||||||
| 権利情報 | copyright©1997 IEICE | |||||
| 著者版フラグ | ||||||
| 値 | publisher | |||||
| 出版者 | ||||||
| 出版者 | Institute of Electronics, Information and Communication Engineers | |||||
| 関係URI | ||||||
| 識別子タイプ | URI | |||||
| 関連識別子 | https://search.ieice.org/ | |||||
