| Presentation | 1998/7/23 A Polynomial-Time Algorithm for Counting Graph Isomorphisms among Partial k-trees. Takayuki NAGOYA, Seiichi TANI, Seinosuke TODA, |
|---|---|
| PDF Download Page | PDF download Page Link |
| Abstract(in Japanese) | (See Japanese page) |
| Abstract(in English) | Given two graphs G, H, and bijection ψ : U → W where U ⊆ V(G)and W ⊆ V(H), counting the number of isomrophism between G and H which do not contradict to ψ isn't known to be computable in polynomial time. In this paper, we show that this probrem is solvable in polymomial time when restricted to the class of partial k-trees. This also implies the existence of a polynimial time algorithm that generates an isomorphism which doesn't contradict to ψ uniformly at random. From these results, given two partial k-tree G and H, counting and random generation for isomorphisms between G and H are computable in polynomial time. |
| Keyword(in Japanese) | (See Japanese page) |
| Keyword(in English) | counting problem / random generation / polynomial time algorithm / graph isomorphithm problem / partial k-tree |
| Paper # | COMP98-24 |
| Date of Issue |
| Conference Information | |
| Committee | COMP |
|---|---|
| Conference Date | 1998/7/23(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) | A Polynomial-Time Algorithm for Counting Graph Isomorphisms among Partial k-trees. |
| Sub Title (in English) | |
| Keyword(1) | counting problem |
| Keyword(2) | random generation |
| Keyword(3) | polynomial time algorithm |
| Keyword(4) | graph isomorphithm problem |
| Keyword(5) | partial k-tree |
| 1st Author's Name | Takayuki NAGOYA |
| 1st Author's Affiliation | The University of Electro-Communications Department of Computer Science and Information Mathematics() |
| 2nd Author's Name | Seiichi TANI |
| 2nd Author's Affiliation | Nihon University College of Humanities and Sciences Department of Applied Mathematics |
| 3rd Author's Name | Seinosuke TODA |
| 3rd Author's Affiliation | Nihon University College of Humanities and Sciences Department of Applied Mathematics |
| Date | 1998/7/23 |
| Paper # | COMP98-24 |
| Volume (vol) | vol.98 |
| Number (no) | 186 |
| Page | pp.pp.- |
| #Pages | 9 |
| Date of Issue | |