| Presentation | 2002/3/5 Computational Complexity of Graph Isomorphism Problem Seinosuke TODA, |
|---|---|
| PDF Download Page | PDF download Page Link |
| Abstract(in Japanese) | (See Japanese page) |
| Abstract(in English) | In this article, we give a survey on the computational complexity of the Graph Isomorphism Problem(GI for short). We first discuss two major evidences by which we may expect GI not to be NP-hard. We next explore the computational complexity of GI for many subclasses of the graphs. This article is a brief part of the paper [S. Toda, Computational Complexity of Graph Isomorphism Problem, IEICE transaction, D-I, February 2002, to appear (in japanese)]. The reader may refer to the paper for more details. |
| Keyword(in Japanese) | (See Japanese page) |
| Keyword(in English) | computational complexity theory / algorithm / graph theory / graph isomorphism problem |
| Paper # | COMP2001-95 |
| Date of Issue |
| Conference Information | |
| Committee | COMP |
|---|---|
| Conference Date | 2002/3/5(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 | Theoretical Foundations of Computing (COMP) |
|---|---|
| Language | JPN |
| Title (in Japanese) | (See Japanese page) |
| Sub Title (in Japanese) | (See Japanese page) |
| Title (in English) | Computational Complexity of Graph Isomorphism Problem |
| Sub Title (in English) | |
| Keyword(1) | computational complexity theory |
| Keyword(2) | algorithm |
| Keyword(3) | graph theory |
| Keyword(4) | graph isomorphism problem |
| 1st Author's Name | Seinosuke TODA |
| 1st Author's Affiliation | College of Humanities and Sciences, Nihon University() |
| Date | 2002/3/5 |
| Paper # | COMP2001-95 |
| Volume (vol) | vol.101 |
| Number (no) | 708 |
| Page | pp.pp.- |
| #Pages | 10 |
| Date of Issue | |