| Item type |
SIG Technical Reports(1) |
| 公開日 |
2018-01-21 |
| タイトル |
|
|
タイトル |
Enumeration of Nonisomorphic Interval Graphs and Nonisomorphic Permutation Graphs |
| タイトル |
|
|
言語 |
en |
|
タイトル |
Enumeration of Nonisomorphic Interval Graphs and Nonisomorphic Permutation Graphs |
| 言語 |
|
|
言語 |
eng |
| 資源タイプ |
|
|
資源タイプ識別子 |
http://purl.org/coar/resource_type/c_18gh |
|
資源タイプ |
technical report |
| 著者所属 |
|
|
|
School of Information Science, Japan Advanced Institute of Science and Technology (JAIST) |
| 著者所属 |
|
|
|
School of Computer Science and Systems Engineering, Kyushu Institute of Technology |
| 著者所属 |
|
|
|
International College of Arts and Sciences, Yokohama City University |
| 著者所属 |
|
|
|
School of Information Science, Japan Advanced Institute of Science and Technology (JAIST) |
| 著者所属(英) |
|
|
|
en |
|
|
School of Information Science, Japan Advanced Institute of Science and Technology (JAIST) |
| 著者所属(英) |
|
|
|
en |
|
|
School of Computer Science and Systems Engineering, Kyushu Institute of Technology |
| 著者所属(英) |
|
|
|
en |
|
|
International College of Arts and Sciences, Yokohama City University |
| 著者所属(英) |
|
|
|
en |
|
|
School of Information Science, Japan Advanced Institute of Science and Technology (JAIST) |
| 著者名 |
Kazuaki, Yamazaki
Toshiki, Saitoh
Masashi, Kiyomi
Ryuhei, Uehara
|
| 著者名(英) |
Kazuaki, Yamazaki
Toshiki, Saitoh
Masashi, Kiyomi
Ryuhei, Uehara
|
| 論文抄録 |
|
|
内容記述タイプ |
Other |
|
内容記述 |
In this paper, a general framework for enumerating every element in a graph class is given. The main feature of this framework is that it is designed to enumerate only non-isomorphic graphs in a graph class. Applying this framework to the classes of interval graphs and permutation graphs, we give efficient enumeration algorithms for these graph classes such that each element in the class is output in a polynomial time delay. The experimental results are also provided. The catalogs of graphs in these graph classes are also provided. |
| 論文抄録(英) |
|
|
内容記述タイプ |
Other |
|
内容記述 |
In this paper, a general framework for enumerating every element in a graph class is given. The main feature of this framework is that it is designed to enumerate only non-isomorphic graphs in a graph class. Applying this framework to the classes of interval graphs and permutation graphs, we give efficient enumeration algorithms for these graph classes such that each element in the class is output in a polynomial time delay. The experimental results are also provided. The catalogs of graphs in these graph classes are also provided. |
| 書誌レコードID |
|
|
収録物識別子タイプ |
NCID |
|
収録物識別子 |
AN1009593X |
| 書誌情報 |
研究報告アルゴリズム（AL）
巻 2018-AL-166,
号 2,
p. 1-8,
発行日 2018-01-21
|
| ISSN |
|
|
収録物識別子タイプ |
ISSN |
|
収録物識別子 |
2188-8566 |
| Notice |
|
|
|
SIG Technical Reports are nonrefereed and hence may later appear in any journals, conferences, symposia, etc. |
| 出版者 |
|
|
言語 |
ja |
|
出版者 |
情報処理学会 |
IPSJ-AL18166002.pdf (779.4 kB)
