| Presentation | 2000/11/27 Counting Graph Isomorphisms among Chordal Graphs with restricted clique number. Takayuki NAGOYA, |
|---|---|
| PDF Download Page | PDF download Page Link |
| Abstract(in Japanese) | (See Japanese page) |
| Abstract(in English) | In this paper, we show that given two chordal graphs G, H with restricted clique number, counting graph isomorphisms among G, H is computable in O(k!n^3)time. |
| Keyword(in Japanese) | (See Japanese page) |
| Keyword(in English) | tree model / perfect elimination scheme |
| Paper # | COMP2000-61 |
| Date of Issue |
| Conference Information | |
| Committee | COMP |
|---|---|
| Conference Date | 2000/11/27(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) | Counting Graph Isomorphisms among Chordal Graphs with restricted clique number. |
| Sub Title (in English) | |
| Keyword(1) | tree model |
| Keyword(2) | perfect elimination scheme |
| 1st Author's Name | Takayuki NAGOYA |
| 1st Author's Affiliation | The University of Electro-Communications Department of Computer Science and Information Mathematics() |
| Date | 2000/11/27 |
| Paper # | COMP2000-61 |
| Volume (vol) | vol.100 |
| Number (no) | 481 |
| Page | pp.pp.- |
| #Pages | 7 |
| Date of Issue | |