Paper Abstract and Keywords |
Presentation |
2011-10-21 11:10
An Extended Result on Polynomial-Time Solvability of the Maximum Clique Problem Hiroaki Nakanishi, Etsuji Tomita, Mitsuo Wakatsuki, Tetsuro Nishino (UEC) COMP2011-30 |
Abstract |
(in Japanese) |
(See Japanese page) |
(in English) |
This report presents a result for polynomial-time solvability of the maximum clique problem, that is:for any 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 2.994dlg n (d≦0: a constant), then the maximum clique problem is solvable in the polynomial time of O(n^{ 2+max{d, 1}}).
In this condition, if the degree of q is greater than or equal to that of p and q is adjacent to no other vertex whose degree is greater than that of q then q is free from any restriction. |
Keyword |
(in Japanese) |
(See Japanese page) |
(in English) |
NP-Complete / Maximum Clique / Depth-First Search / Time-Complexity / Degree of a vertex / / / |
Reference Info. |
IEICE Tech. Rep., vol. 111, no. 256, COMP2011-30, pp. 15-22, Oct. 2011. |
Paper # |
COMP2011-30 |
Date of Issue |
2011-10-14 (COMP) |
ISSN |
Print edition: ISSN 0913-5685 Online edition: ISSN 2432-6380 |
Copyright and reproduction |
All rights are reserved and no part of this publication may be reproduced or transmitted in any form or by any means, electronic or mechanical, including photocopy, recording, or any information storage and retrieval system, without permission in writing from the publisher. Notwithstanding, instructors are permitted to photocopy isolated articles for noncommercial classroom use without fee. (License No.: 10GA0019/12GB0052/13GB0056/17GB0034/18GB0034) |
Download PDF |
COMP2011-30 |
Conference Information |
Committee |
COMP |
Conference Date |
2011-10-21 - 2011-10-21 |
Place (in Japanese) |
(See Japanese page) |
Place (in English) |
Tohoku Univ. |
Topics (in Japanese) |
(See Japanese page) |
Topics (in English) |
|
Paper Information |
Registration To |
COMP |
Conference Code |
2011-10-COMP |
Language |
Japanese |
Title (in Japanese) |
(See Japanese page) |
Sub Title (in Japanese) |
(See Japanese page) |
Title (in English) |
An 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 |
Keyword(6) |
|
Keyword(7) |
|
Keyword(8) |
|
1st Author's Name |
Hiroaki Nakanishi |
1st Author's Affiliation |
Univesity of Electro-Communications (UEC) |
2nd Author's Name |
Etsuji Tomita |
2nd Author's Affiliation |
Univesity of Electro-Communications (UEC) |
3rd Author's Name |
Mitsuo Wakatsuki |
3rd Author's Affiliation |
Univesity of Electro-Communications (UEC) |
4th Author's Name |
Tetsuro Nishino |
4th Author's Affiliation |
Univesity of Electro-Communications (UEC) |
5th Author's Name |
|
5th Author's Affiliation |
() |
6th Author's Name |
|
6th Author's Affiliation |
() |
7th Author's Name |
|
7th Author's Affiliation |
() |
8th Author's Name |
|
8th Author's Affiliation |
() |
9th Author's Name |
|
9th Author's Affiliation |
() |
10th Author's Name |
|
10th Author's Affiliation |
() |
11th Author's Name |
|
11th Author's Affiliation |
() |
12th Author's Name |
|
12th Author's Affiliation |
() |
13th Author's Name |
|
13th Author's Affiliation |
() |
14th Author's Name |
|
14th Author's Affiliation |
() |
15th Author's Name |
|
15th Author's Affiliation |
() |
16th Author's Name |
|
16th Author's Affiliation |
() |
17th Author's Name |
|
17th Author's Affiliation |
() |
18th Author's Name |
|
18th Author's Affiliation |
() |
19th Author's Name |
|
19th Author's Affiliation |
() |
20th Author's Name |
|
20th Author's Affiliation |
() |
Speaker |
Author-1 |
Date Time |
2011-10-21 11:10:00 |
Presentation Time |
35 minutes |
Registration for |
COMP |
Paper # |
COMP2011-30 |
Volume (vol) |
vol.111 |
Number (no) |
no.256 |
Page |
pp.15-22 |
#Pages |
8 |
Date of Issue |
2011-10-14 (COMP) |
|