Presentation | 2008-05-16 A Consideration on k-Clique Problem and Graph k-Colorability Kunikatsu KOBAYASHI, |
---|---|
PDF Download Page | PDF download Page Link |
Abstract(in Japanese) | (See Japanese page) |
Abstract(in English) | We examine the solutions of k-clique problem and graph k-colorability. We propose the polynomial time algorithms of k-clique problem and graph k-colorability. |
Keyword(in Japanese) | (See Japanese page) |
Keyword(in English) | k-clique problem / graph k-colorability / NP complete / NP=P |
Paper # | ISEC2008-6 |
Date of Issue |
Conference Information | |
Committee | ISEC |
---|---|
Conference Date | 2008/5/9(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 | Information Security (ISEC) |
---|---|
Language | JPN |
Title (in Japanese) | (See Japanese page) |
Sub Title (in Japanese) | (See Japanese page) |
Title (in English) | A Consideration on k-Clique Problem and Graph k-Colorability |
Sub Title (in English) | |
Keyword(1) | k-clique problem |
Keyword(2) | graph k-colorability |
Keyword(3) | NP complete |
Keyword(4) | NP=P |
1st Author's Name | Kunikatsu KOBAYASHI |
1st Author's Affiliation | Faculty of Engineering, Yamagata University() |
Date | 2008-05-16 |
Paper # | ISEC2008-6 |
Volume (vol) | vol.108 |
Number (no) | 38 |
Page | pp.pp.- |
#Pages | 4 |
Date of Issue |