WEKO3
アイテム
A Method to Calculate Legal Sequence Number for Extended Series-Parallel Digraphs
https://ipsj.ixsq.nii.ac.jp/records/130170
https://ipsj.ixsq.nii.ac.jp/records/130170162ea32c-4317-4fd9-9496-e8db4b06df15
| 名前 / ファイル | ライセンス | アクション |
|---|---|---|
|
|
|
| Item type | National Convention(1) | |||||
|---|---|---|---|---|---|---|
| 公開日 | 1996-09-04 | |||||
| タイトル | ||||||
| 言語 | en | |||||
| タイトル | A Method to Calculate Legal Sequence Number for Extended Series-Parallel Digraphs | |||||
| 言語 | ||||||
| 言語 | eng | |||||
| 資源タイプ | ||||||
| 資源タイプ識別子 | http://purl.org/coar/resource_type/c_5794 | |||||
| 資源タイプ | conference paper | |||||
| 著者所属 | ||||||
| 山口大 | ||||||
| 著者所属 | ||||||
| 山口大 | ||||||
| 著者所属(英) | ||||||
| en | ||||||
| Faculty of Education, Yamaguchi University, Japan | ||||||
| 著者所属(英) | ||||||
| en | ||||||
| Faculty of Education, Yamaguchi University, Japan | ||||||
| 論文抄録(英) | ||||||
| 内容記述タイプ | Other | |||||
| 内容記述 | The problem of topological sorting is, given with a directed acyclic graph G=(V, E), to find a total ordering of the vertices such that if (u, v)∈E then u is ordered before v. Instead of finding total orderings, we wish to find out how many total orderings exist in a given directed acyclic graph G=(V, E). We call a total ordering of the vertices as legal sequence and the problem as LSN(legal sequence number) problem. In this paper we study how to calculate LSN for a given directed acyclic graph G=(V, E). First we give the fundamental theorems for calculating LSN of general directed acyclic graphs. Then we give a way to calculate LSN for series-parallel digraphs and methods to transform a class of extended series-parallel digraphs into series-parallel ones. Finally we calculate LSN for the class of graphs, which are extended from series-parallel digraphs by adding so called bridge edges and bridge-path between specific paths. | |||||
| 書誌レコードID | ||||||
| 収録物識別子タイプ | NCID | |||||
| 収録物識別子 | AN00349328 | |||||
| 書誌情報 |
全国大会講演論文集 巻 第53回, 号 ソフトウェア科学・工学, p. 157-158, 発行日 1996-09-04 |
|||||
| 出版者 | ||||||
| 言語 | ja | |||||
| 出版者 | 情報処理学会 | |||||