Paper Abstract and Keywords |
Presentation |
2021-03-08 15:45
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 |
Abstract |
(in Japanese) |
(See Japanese page) |
(in English) |
We improve further the MCT algorithm for finding a maximum clique (FAW 2016, LNCS 9711, pp.215-226, 2016). First, we employ a new efficient approximation algorithm for finding a maximum clique. Second, we change the threshold to enable the appropriate disposal of search trees depending on the scale. Third, we employ a branch-and-bound technique that has already been shown effective by other algorithms. It is shown that a new algorithm is much faster than MCT by extensive computational experiments. In addition, it is shown that the new algorithm is faster than the up-to-date IncMC2 algorithm (INFORMS J. Computing, 30, pp.137-153, 2018) for many problems. |
Keyword |
(in Japanese) |
(See Japanese page) |
(in English) |
maximum clique / depth-first search / approximation algorithm / graph theory / / / / |
Reference Info. |
IEICE Tech. Rep., vol. 120, no. 426, COMP2020-35, pp. 38-45, March 2021. |
Paper # |
COMP2020-35 |
Date of Issue |
2021-03-01 (COMP) |
ISSN |
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 |
COMP2020-35 |
|