IEICE Technical Committee Submission System
Conference Schedule 
Online Proceedings
[Sign in] ... (for ESS/CS/ES/ISS)
Tech. Rep. Archives ... (for ES/CS)



All Technical Committee Conferences (All Years)


Search Results: Conference Papers 
Conference Papers (Available on Advance Programs) (Sort by: Date Descending) 

Committee 
Date Time 
Place 
Paper Title / Authors 
Abstract 
Paper # 
COMP, IPSJAL 
20140614 10:55 
Ehime 
Matsuyama, Ehime 
A Further Improved Extended Result on PolynomialTime Solvability of the Maximum Clique Problem Hiroaki Nakanishi (Waseda Univ.), Etsuji Tomita, Mitsuo Wakatsuki, Tetsuro Nishino (UEC) COMP201413 
This paper presents a further improved extended result for polynomialtime solvability of the maximum clique problem, th... [more] 
COMP201413 pp.8592 
COMP 
20120903 10:50 
Tokyo 
Hosei University 
An Improved Extended Result on PolynomialTime Solvability of the Maximum Clique Problem Hiroaki Nakanishi, Etsuji Tomita, Mitsuo Wakatsuki, Tetsuro Nishino (UEC) COMP201228 
This paper presents an improved extended result for polynomialtime solvability of the maximum clique problem, that is:
... [more] 
COMP201228 pp.1724 
COMP 
20111021 11:10 
Miyagi 
Tohoku Univ. 
An Extended Result on PolynomialTime Solvability of the Maximum Clique Problem Hiroaki Nakanishi, Etsuji Tomita, Mitsuo Wakatsuki, Tetsuro Nishino (UEC) COMP201130 
This report presents a result for polynomialtime solvability of the maximum clique problem, that is:for any pair of ver... [more] 
COMP201130 pp.1522 
COMP 
20110422 13:55 
Kyoto 
Kyoto University 
A further improved result on polynomialtime solvability of the maximum clique problem Hiroaki Nakanishi (UEC), Etsuji Tomita (UEC/Chuo Univ.), Mitsuo Wakatsuki, Tetsuro Nishino (UEC) COMP20116 
This report presents a further improved result for polynomialtime solvability of the maximum clique problem, that is: f... [more] 
COMP20116 pp.4148 
COMP 
20101203 14:30 
Fukuoka 
Kyutech Plaza, Kyushu Institute of Technology 
An improved result on polynomialtime solvability of the maximum clique problem Hiroaki Nakanishi, Etsuji Tomita (UEC) COMP201043 
This report presents an improved result for polynomialtime solvability of the maximum clique problem which is a typical... [more] 
COMP201043 pp.2936 
COMP 
20071016 15:30 
Miyagi 
Tohoku Univ. 
An O(2^0.24945n)time and Polynomialspace Algorithm Hiroaki Nakanishi, Etsuji Tomita (Univ. of ElectroComun.) COMP200746 
The maximum clique problem is an NPhard problem, and is difficult
to solve efficiently. The trivial upper bound of its... [more] 
COMP200746 pp.3340 
COMP 
20070629 09:00 
Hokkaido 
Hokkaido University 
A Computaional Complexity for finding a Maximum Clique in a Graph with Maximum Degree 4 Hiroaki Nakanishi, Etsuji Tomita (UEC) COMP200718 
The maximum clique problem is an NPhard problem, and is difficult
to solve efficiently. The trivial upper bound of its... [more] 
COMP200718 pp.17 



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. (No. 10GA0019/12GB0052/13GB0056/17GB0034/18GB0034)

[Return to Top Page]
[Return to IEICE Web Page]
