IEICE Technical Committee Submission System
Conference Paper's Information
Online Proceedings
[Sign in]
Tech. Rep. Archives
 Go Top Page Go Previous   [Japanese] / [English] 

Paper Abstract and Keywords
Presentation 2007-10-16 15:30
An O(2^0.24945n)-time and Polynomial-space Algorithm
Hiroaki Nakanishi, Etsuji Tomita (Univ. of Electro-Comun.) COMP2007-46
Abstract (in Japanese) (See Japanese page) 
(in English) The maximum clique problem is an NP-hard problem, and is difficult
to solve efficiently. The trivial upper bound of its time complexity
is O(P(n)2^n), where P(n) is a polynomial of n, the number of
vertices. Several improvements have been done for this upper bound.
In this note, we present a simple polynomial-space algorithm MAXCLIQUE,
and we prove that its time complexity is O(2^0.24945n).
Keyword (in Japanese) (See Japanese page) 
(in English) NP-hard / Maximum clique / Maximum independent set / Time complexity / Space complexity / / /  
Reference Info. IEICE Tech. Rep., vol. 107, no. 258, COMP2007-46, pp. 33-40, Oct. 2007.
Paper # COMP2007-46 
Date of Issue 2007-10-09 (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 COMP2007-46

Conference Information
Committee COMP  
Conference Date 2007-10-16 - 2007-10-16 
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 2007-10-COMP 
Language Japanese 
Title (in Japanese) (See Japanese page) 
Sub Title (in Japanese) (See Japanese page) 
Title (in English) An O(2^0.24945n)-time and Polynomial-space Algorithm 
Sub Title (in English)  
Keyword(1) NP-hard  
Keyword(2) Maximum clique  
Keyword(3) Maximum independent set  
Keyword(4) Time complexity  
Keyword(5) Space complexity  
Keyword(6)  
Keyword(7)  
Keyword(8)  
1st Author's Name Hiroaki Nakanishi  
1st Author's Affiliation The University of Electro-Communications (Univ. of Electro-Comun.)
2nd Author's Name Etsuji Tomita  
2nd Author's Affiliation The University of Electro-Communications (Univ. of Electro-Comun.)
3rd Author's Name  
3rd Author's Affiliation ()
4th Author's Name  
4th Author's Affiliation ()
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 2007-10-16 15:30:00 
Presentation Time 35 minutes 
Registration for COMP 
Paper # COMP2007-46 
Volume (vol) vol.107 
Number (no) no.258 
Page pp.33-40 
#Pages
Date of Issue 2007-10-09 (COMP) 


[Return to Top Page]

[Return to IEICE Web Page]


The Institute of Electronics, Information and Communication Engineers (IEICE), Japan