| Presentation | 2013-07-12 On Unit Grid Intersection Graphs Asahi TAKAOKA, Satoshi TAYU, Shuichi UENO, |
|---|---|
| PDF Download Page |  PDF download Page Link |
| Abstract(in Japanese) | (See Japanese page) |
| Abstract(in English) | This paper shows that the recognition problem for unit grid intersection graphs is NP-complete. We also show that any grid graph is a unit grid intersection graph. It follows that many problems are NP-hard for unit grid intersection graphs. |
| Keyword(in Japanese) | (See Japanese page) |
| Keyword(in English) | grid graphs / recognition problem / unit grid intersection graphs |
| Paper # | CAS2013-31,VLD2013-41,SIP2013-61,MSS2013-31 |
| Date of Issue |
| Conference Information | |
| Committee | VLD |
|---|---|
| Conference Date | 2013/7/4(1days) |
| Place (in Japanese) | (See Japanese page) |
| Place (in English) | |
| Topics (in Japanese) | (See Japanese page) |
| Topics (in English) | |
| Chair | |
| Vice Chair | |
| Secretary | |
| Assistant | |
| Paper Information | |
| Registration To | VLSI Design Technologies (VLD) |
|---|---|
| Language | ENG |
| Title (in Japanese) | (See Japanese page) |
| Sub Title (in Japanese) | (See Japanese page) |
| Title (in English) | On Unit Grid Intersection Graphs |
| Sub Title (in English) | |
| Keyword(1) | grid graphs |
| Keyword(2) | recognition problem |
| Keyword(3) | unit grid intersection graphs |
| 1st Author's Name | Asahi TAKAOKA |
| 1st Author's Affiliation | Department of Communications and Computer Engineering, Tokyo Institute of Technology() |
| 2nd Author's Name | Satoshi TAYU |
| 2nd Author's Affiliation | Department of Communications and Computer Engineering, Tokyo Institute of Technology |
| 3rd Author's Name | Shuichi UENO |
| 3rd Author's Affiliation | Department of Communications and Computer Engineering, Tokyo Institute of Technology |
| Date | 2013-07-12 |
| Paper # | CAS2013-31,VLD2013-41,SIP2013-61,MSS2013-31 |
| Volume (vol) | vol.113 |
| Number (no) | 119 |
| Page | pp.pp.- |
| #Pages | 5 |
| Date of Issue | |