| Item type |
SIG Technical Reports(1) |
| 公開日 |
2017-11-09 |
| タイトル |
|
|
タイトル |
［招待講演］On the Recognition of Unit Grid lntersection Graphs |
| タイトル |
|
|
言語 |
en |
|
タイトル |
On the Recognition of Unit Grid Intersection Graphs |
| 言語 |
|
|
言語 |
eng |
| 資源タイプ |
|
|
資源タイプ識別子 |
http://purl.org/coar/resource_type/c_18gh |
|
資源タイプ |
technical report |
| 著者所属 |
|
|
|
Department of Information and Communications Engineering Tokyo Institute of Technology |
| 著者所属 |
|
|
|
Department of Information and Communications Engineering Tokyo Institute of Technology |
| 著者所属(英) |
|
|
|
en |
|
|
Department of Information and Communications Engineering Tokyo Institute of Technology |
| 著者所属(英) |
|
|
|
en |
|
|
Department of Information and Communications Engineering Tokyo Institute of Technology |
| 著者名 |
Satoshi, Tayu
Shuichi, Ueno
|
| 著者名(英) |
Satoshi, Tayu
Shuichi, Ueno
|
| 論文抄録 |
|
|
内容記述タイプ |
Other |
|
内容記述 |
Unit grid intersection graphs are the intersection graphs of horizontal and vertical line segrments with unit length in the plane. We show in this paper that the recognition problem for unit grid intersection graphs is NP-complete. |
| 論文抄録(英) |
|
|
内容記述タイプ |
Other |
|
内容記述 |
Unit grid intersection graphs are the intersection graphs of horizontal and vertical line segrments with unit length in the plane. We show in this paper that the recognition problem for unit grid intersection graphs is NP-complete. |
| 書誌レコードID |
|
|
収録物識別子タイプ |
NCID |
|
収録物識別子 |
AN1009593X |
| 書誌情報 |
研究報告アルゴリズム（AL）
巻 2017-AL-165,
号 5,
p. 1-6,
発行日 2017-11-09
|
| ISSN |
|
|
収録物識別子タイプ |
ISSN |
|
収録物識別子 |
2188-8566 |
| Notice |
|
|
|
SIG Technical Reports are nonrefereed and hence may later appear in any journals, conferences, symposia, etc. |
| 出版者 |
|
|
言語 |
ja |
|
出版者 |
情報処理学会 |
IPSJ-AL17165005.pdf (674.2 kB)
