A Simple and Faster Branch-and-Bound Algorithm for Finding a Maximum Clique with Computational Experiments-Reference-Cited by-同舟云学术

A Simple and Faster Branch-and-Bound Algorithm for Finding a Maximum Clique with Computational Experiments

Published:2013 Issue:6 Volume:E96.D Page:1286-1298
ISSN:0916-8532
Container-title:IEICE Transactions on Information and Systems
language:en
Short-container-title:IEICE Trans. Inf. & Syst.

Author:

TOMITA Etsuji¹²³,SUTANI Yoichi¹⁴,HIGASHI Takanori¹⁵,WAKATSUKI Mitsuo¹⁶

Affiliation:

1. Advanced Algorithms Research Laboratory, The University of Electro-Communications

2. JST ERATO Minato Discrete Structure Manipulation System Project

3. Tokyo Institute of Technology

4. Sony Corporation

5. Japan Systems Co., Ltd.

6. Graduate School of Informatics and Engineering, The University of Electro-Communications

Publisher

Institute of Electronics, Information and Communications Engineers (IEICE)

Subject

Artificial Intelligence,Electrical and Electronic Engineering,Computer Vision and Pattern Recognition,Hardware and Architecture,Software

Link

https://www.jstage.jst.go.jp/article/transinf/E96.D/6/E96.D_1286/_pdf

Reference52 articles.

1. [1] T. Akutsu, M. Hayashida, D.K.C. Bahadur, E. Tomita, J. Suzuki, and K. Horimoto, “Dynamic programming and clique based approaches for protein threading with profiles and constraints,” IEICE Trans. Fundamentals, vol.E89-A, no.5, pp.1215-1222, May 2006.

2. [2] D.K.C. Bahadur, T. Akutsu, E. Tomita, T. Seki, and A. Fujiyama, “Point matching under non-uniform distortions and protein side chain packing based on efficient maximum clique algorithms,” Genome Inform., vol.13, pp.143-152, 2002.

3. [3] D.K.C. Bahadur, E. Tomita, J. Suzuki, K. Horimoto, and T. Akutsu, “Protein side-chain packing problem: A maximum edge-weight clique algorithmic approach.” J. Bioinform. and Comput. Biol., vol.3, pp.103-126, 2005.

4. [4] D.K.C. Bahadur, E. Tomita., J. Suzuki, K. Horimoto, and T. Akutsu, “Protein threading with profiles and distance constraints using clique based algorithms,” J. Bioinform. and Comput. Biol., vol.4, pp.19-42, 2006.

5. [5] E. Balas, S. Ceria, G. Cornuéjols, and G. Pataki, “Polyhedral methods for the maximum clique problem,” in DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol.26, ed. D.S. Johnson and M.A. Trick, pp.11-28, 1996.

Cited by 13 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. SMC-BRB: an algorithm for the maximum clique problem over large and sparse graphs with the upper bound via $$s^+$$-index;The Journal of Supercomputing;2022-12-12

2. An approximation lagrangian-based algorithm for the maximum clique problem via deterministic annealing neural network;Journal of the Franklin Institute;2022-08

3. Efficient Reductions and a Fast Algorithm of Maximum Weighted Independent Set;Proceedings of the Web Conference 2021;2021-04-19

4. Testing a Heuristic Algorithm for Finding a Maximum Clique on DIMACS and Facebook Graphs;WSEAS TRANSACTIONS ON SYSTEMS AND CONTROL;2020-03-31

5. Pure MaxSAT and Its Applications to Combinatorial Optimization via Linear Local Search;Lecture Notes in Computer Science;2020