| Presentation | 2016-11-25 A Note on the Spanning Subgraph Isomorphism Problem Satoshi Tayu, Kenji Ichikawa, Shuichi Ueno, |
|---|---|
| PDF Download Page |  PDF download Page Link |
| Abstract(in Japanese) | (See Japanese page) |
| Abstract(in English) | We consider the subgraph isomorphism problem of two graphs which is to decide if a pattern graph is isomorphic to a subgraph of a base graph. It is known that the problem is NP-complete if the pattern and base graphs are bipartite permutation graphs with the same number of vertices. We show that the problem is NP-complete even if the pattern graph is an n-vertex tree of pathwidth at most 2 and the base graph is an n-vertex bipartite permutation graph. |
| Keyword(in Japanese) | (See Japanese page) |
| Keyword(in English) | 3-partition problembipartite parmutation graphNP-completespanning subgraph isomorphism |
| Paper # | CAS2016-69,MSS2016-49 |
| Date of Issue | 2016-11-17 (CAS, MSS) |
| Conference Information | |
| Committee | MSS / CAS / IPSJ-AL |
|---|---|
| Conference Date | 2016/11/24(2days) |
| Place (in Japanese) | (See Japanese page) |
| Place (in English) | Kobe Institute of Computing |
| Topics (in Japanese) | (See Japanese page) |
| Topics (in English) | |
| Chair | Satoshi Yamane(Kanazawa Univ.) / Toshihiko Takahashi(Niigata Univ.) |
| Vice Chair | Morikazu Nakamura(Univ. of Ryukyus) / Mitsuru Hiraki(Renesas) |
| Secretary | Morikazu Nakamura(Yamaguchi Univ.) / Mitsuru Hiraki(Toshiba) / (Tohoku Univ.) |
| Assistant | Hideki Kinjo(Okinawa Univ.) / Toshihiro Tachibana(Shonan Inst. of Tech.) / Yohei Nakamura(Hitachi) |
| Paper Information | |
| Registration To | Technical Committee on Mathematical Systems Science and its applications / Technical Committee on Circuits and Systems / Special Interest Group on Algorithms |
|---|---|
| Language | ENG |
| Title (in Japanese) | (See Japanese page) |
| Sub Title (in Japanese) | (See Japanese page) |
| Title (in English) | A Note on the Spanning Subgraph Isomorphism Problem |
| Sub Title (in English) | |
| Keyword(1) | 3-partition problembipartite parmutation graphNP-completespanning subgraph isomorphism |
| 1st Author's Name | Satoshi Tayu |
| 1st Author's Affiliation | Tokyo Institute of Technology(Tokyo Tech) |
| 2nd Author's Name | Kenji Ichikawa |
| 2nd Author's Affiliation | Tokyo Institute of Technology(Tokyo Tech) |
| 3rd Author's Name | Shuichi Ueno |
| 3rd Author's Affiliation | Tokyo Institute of Technology(Tokyo Tech) |
| Date | 2016-11-25 |
| Paper # | CAS2016-69,MSS2016-49 |
| Volume (vol) | vol.116 |
| Number (no) | CAS-315,MSS-316 |
| Page | pp.pp.83-88(CAS), pp.83-88(MSS), |
| #Pages | 6 |
| Date of Issue | 2016-11-17 (CAS, MSS) |