| Presentation | 1998/12/4 Simple Algorithm for Recognizing 4-map Graphs without Lakes Zhi-Zhong Chen, |
|---|---|
| PDF Download Page | PDF download Page Link |
| Abstract(in Japanese) | (See Japanese page) |
| Abstract(in English) | This paper presents a simple algorithm for recognizing 4-map graphs without lakes. The algorithm runs in O(n^6) time. |
| Keyword(in Japanese) | (See Japanese page) |
| Keyword(in English) | planar graphs / map graphs / graph algorithms / Computational complexity |
| Paper # | COMP98-64 |
| Date of Issue |
| Conference Information | |
| Committee | COMP |
|---|---|
| Conference Date | 1998/12/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 | Theoretical Foundations of Computing (COMP) |
|---|---|
| Language | ENG |
| Title (in Japanese) | (See Japanese page) |
| Sub Title (in Japanese) | (See Japanese page) |
| Title (in English) | Simple Algorithm for Recognizing 4-map Graphs without Lakes |
| Sub Title (in English) | |
| Keyword(1) | planar graphs |
| Keyword(2) | map graphs |
| Keyword(3) | graph algorithms |
| Keyword(4) | Computational complexity |
| 1st Author's Name | Zhi-Zhong Chen |
| 1st Author's Affiliation | Department of Mathematical Sciences, Tokyo Denki University() |
| Date | 1998/12/4 |
| Paper # | COMP98-64 |
| Volume (vol) | vol.98 |
| Number (no) | 442 |
| Page | pp.pp.- |
| #Pages | 8 |
| Date of Issue | |