| IEICE Technical Committee Submission System Conference Schedule |
Online Proceedings [Sign in] Tech. Rep. Archives |
All Technical Committee Conferences (Searched in: All Years)
| Committee | Date Time | Place | Paper Title / Authors | Abstract | Paper # | |
| COMP | 2021-12-03 | Ishikawa | Kanazawa Chamber of Commerce and Industry (Primary: On-site, Secondary: Online) |
Polynomial-time Extraction of the Maximum Clique Using Eigenvalue Relation Yasunori Ohto |
We prove that the maximum clique problem can be solved in polynomial time. First, we prove the relationship between the ... [more] | |
| COMP | 2021-03-08 15:15 |
Online | Online | A hyper-heuristic for the maximum clique problem Kazuho Kanahara, Kengo Katayama (OUS), Etsuji Tomita (UEC)  COMP2020-34 |
The maximum clique problem (MCP) is one of the most important combinatorial optimization problems that has many practica... [more] | COMP2020-34 pp.30-37 |
| COMP | 2021-03-08 15:45 |
Online | Online | A further improved MCT algorithm for finding a maximum clique Jiro Yanagisawa, Etsuji Tomita (UEC), Kengo Katayama, Kanahara Kazuho (OUS), Takahisa Toda, Hiro Ito, Mitsuo Wakatsuki, Tetsuro Nishino (UEC) COMP2020-35 |
We improve further the MCT algorithm for finding a maximum clique （FAW 2016, LNCS 9711, pp.215-226, 2016). First, we em... [more] | COMP2020-35 pp.38-45 |
| SIP, IT, RCS | 2021-01-22 10:40 |
Online | Online | Optimal Non-binary Single Insertion Deletion Correcting Code Construction by Maximum Clique Enumeration Akira Mitsutake, Takayuki Nozaki (Yamaguchi Univ.), Etsuji Tomita (UEC) IT2020-89 SIP2020-67 RCS2020-180 |
The purpose of this research is to construct non-binary single deletion correcting codes with large cardinalities. It i... [more] |
IT2020-89 SIP2020-67 RCS2020-180 pp.142-147 |
| COMP, IPSJ-AL | 2014-06-14 10:55 |
Ehime | Matsuyama, Ehime | A Further Improved Extended Result on Polynomial-Time Solvability of the Maximum Clique Problem Hiroaki Nakanishi (Waseda Univ.), Etsuji Tomita, Mitsuo Wakatsuki, Tetsuro Nishino (UEC) COMP2014-13 |
This paper presents a further improved extended result for polynomial-time solvability of the maximum clique problem, th... [more] | COMP2014-13 pp.85-92 |
| IPSJ-SLDM, CPSY, RECONF, VLD [detail] | 2014-01-28 08:55 |
Kanagawa | Hiyoshi Campus, Keio University | A Unified Software/Reconfigurable Hardware Approach to Solving the Maximum Clique Problem of Large Graphs Chikako Miura, Shinobu Nagayama, Shin'ichi Wakabayashi, Masato Inagi (Hiroshima City Univ.) VLD2013-103 CPSY2013-74 RECONF2013-57 |
We propose an algorithm to solve the maximum clique problem of large graphs. The proposed algorithm is a unified softwar... [more] | VLD2013-103 CPSY2013-74 RECONF2013-57 pp.7-12 |
| COMP | 2013-03-18 15:15 |
Gifu | Gifu University | A New Exact Algorithm for the Maximum Weight Clique Problem Based on an Upper Bound Calculated by Dynamic Programming Satoshi Shimizu, Kazuaki Yamaguchi, Toshiki Saitoh, Sumio Masuda (Kobe Univ.) COMP2012-59 |
Given a vertex-weighted undirected graph, the problem to find the clique of maximum weight is the maximum weight clique ... [more] | COMP2012-59 pp.47-53 |
| VLD, DC, IPSJ-SLDM, CPSY, RECONF, ICD, CPM (Joint) [detail] |
2012-11-28 10:30 |
Fukuoka | Centennial Hall Kyushu University School of Medicine | A Hardware Algorithm Using Dynamically Partially Reconfigurable FPGAs for Solving the Maximum Clique Problem of Large Graphs Chikako Miura, Shinobu Nagayama, Shin'ichi Wakabayashi, Masato Inagi (Hiroshima City Univ.) RECONF2012-53 |
In this paper, we propose a hardware algorithm to solve the maximum clique problem of large graphs, and show its impleme... [more] | RECONF2012-53 pp.33-38 |
| COMP | 2012-09-03 10:50 |
Tokyo | Hosei University | An Improved Extended Result on Polynomial-Time Solvability of the Maximum Clique Problem Hiroaki Nakanishi, Etsuji Tomita, Mitsuo Wakatsuki, Tetsuro Nishino (UEC) COMP2012-28 |
This paper presents an improved extended result for polynomial-time solvability of the maximum clique problem, that is: ... [more] |
COMP2012-28 pp.17-24 |
| COMP | 2011-10-21 11:10 |
Miyagi | Tohoku Univ. | An Extended Result on Polynomial-Time Solvability of the Maximum Clique Problem Hiroaki Nakanishi, Etsuji Tomita, Mitsuo Wakatsuki, Tetsuro Nishino (UEC) COMP2011-30 |
This report presents a result for polynomial-time solvability of the maximum clique problem, that is:for any pair of ver... [more] | COMP2011-30 pp.15-22 |
| COMP | 2011-04-22 13:55 |
Kyoto | Kyoto University | A further improved result on polynomial-time solvability of the maximum clique problem Hiroaki Nakanishi (UEC), Etsuji Tomita (UEC/Chuo Univ.), Mitsuo Wakatsuki, Tetsuro Nishino (UEC) COMP2011-6 |
This report presents a further improved result for polynomial-time solvability of the maximum clique problem, that is: f... [more] | COMP2011-6 pp.41-48 |
| COMP | 2010-12-03 14:30 |
Fukuoka | Kyutech Plaza, Kyushu Institute of Technology | An improved result on polynomial-time solvability of the maximum clique problem Hiroaki Nakanishi, Etsuji Tomita (UEC) COMP2010-43 |
This report presents an improved result for polynomial-time solvability of the maximum clique problem which is a typical... [more] | COMP2010-43 pp.29-36 |
| DC | 2008-02-08 15:40 |
Tokyo | Kikai-Shinko-Kaikan Bldg. | Comparison of exact solutions and greedy solutions in static test compaction Kei Yagisawa, Koji Yamazaki (Meiji Univ.), Toshinori Hosokawa (Nihon Univ.), Hisao Tamaki (Meiji Univ.) DC2007-79 |
In this paper, we formulate static test compaction using don't cares as a minimum clique cover problem and a vertex colo... [more] | DC2007-79 pp.77-82 |
| COMP | 2007-10-16 15:30 |
Miyagi | Tohoku Univ. | An O(2^0.24945n)-time and Polynomial-space Algorithm Hiroaki Nakanishi, Etsuji Tomita (Univ. of Electro-Comun.) COMP2007-46 |
The maximum clique problem is an NP-hard problem, and is difficult to solve efficiently. The trivial upper bound of its... [more] |
COMP2007-46 pp.33-40 |
| COMP | 2007-06-29 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) COMP2007-18 |
The maximum clique problem is an NP-hard problem, and is difficult to solve efficiently. The trivial upper bound of its... [more] |
COMP2007-18 pp.1-7 |
[Return to Top Page]