| Presentation | 2014/6/6 A Further Improved Extended Result on Polynomial-Time Solvability of the Maximum Clique Problem Hiroaki NAKANISHI, Etsuji TOMITA, Mitsuo WAKATSUKI, Tetsuro NISHINO, |
|---|---|
| PDF Download Page | PDF download Page Link |
| Abstract(in Japanese) | (See Japanese page) |
| Abstract(in English) | This paper presents a further improved extended result for polynomial-time solvability of the maximum clique problem, that is: for any adjacent pair of vertices p and q where the degree of p is less than or equal to that of q in a graph with n vertices, if the degree of p is less than or equal to 3.486dlgn (d≧0: a constant), then the maximum clique problem is solvable in the polynomial time of O(n^<2+max{d,1}>). This result is obtained by more detailed analysis and the corresponding detailed algorithm. |
| Keyword(in Japanese) | (See Japanese page) |
| Keyword(in English) | NP-Complete / Maximum Clique / Depth-First Search / Time-Complexity / Degree of a vertex |
| Paper # | |
| Date of Issue |
| Conference Information | |
| Committee | COMP |
|---|---|
| Conference Date | 2014/6/6(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 Further Improved Extended Result on Polynomial-Time Solvability of the Maximum Clique Problem |
| Sub Title (in English) | |
| Keyword(1) | NP-Complete |
| Keyword(2) | Maximum Clique |
| Keyword(3) | Depth-First Search |
| Keyword(4) | Time-Complexity |
| Keyword(5) | Degree of a vertex |
| 1st Author's Name | Hiroaki NAKANISHI |
| 1st Author's Affiliation | The Advanced Algorithms Research Laboratory, The University of Electro-Communications:Department of Mathematics, School of Education, Waseda University() |
| 2nd Author's Name | Etsuji TOMITA |
| 2nd Author's Affiliation | The Advanced Algorithms Research Laboratory, The University of Electro-Communications:JST ERATO Minato Discrete Structure Manipulation System Project:Graduate School of Information Science and Engineering, Tokyo Institute of Technology |
| 3rd Author's Name | Mitsuo WAKATSUKI |
| 3rd Author's Affiliation | The Advanced Algorithms Research Laboratory, The University of Electro-Communications:Graduate School of Informatics and Engineering, The University of Electro-Communications |
| 4th Author's Name | Tetsuro NISHINO |
| 4th Author's Affiliation | The Advanced Algorithms Research Laboratory, The University of Electro-Communications:Graduate School of Informatics and Engineering, The University of Electro-Communications |
| Date | 2014/6/6 |
| Paper # | |
| Volume (vol) | vol.114 |
| Number (no) | 80 |
| Page | pp.pp.- |
| #Pages | 8 |
| Date of Issue | |