An exact bit-parallel algorithm for the maximum clique problem-Reference-Cited by-同舟云学术

An exact bit-parallel algorithm for the maximum clique problem

Published:2011-02 Issue:2 Volume:38 Page:571-581
ISSN:0305-0548
Container-title:Computers & Operations Research
language:en
Short-container-title:Computers & Operations Research

Author:

San Segundo Pablo,Rodríguez-Losada Diego,Jiménez Agustín

Publisher

Elsevier BV

Subject

Management Science and Operations Research,Modeling and Simulation,General Computer Science

Reference24 articles.

1. Karp RM. In: Miller RE, Thatcher JW, editors. Reducibility among combinatorial problems. New York: Plenum; 1972. p. 85–103.

2. Point matching under non-uniform distortions and protein side chain packing based on efficient maximum clique algorithms;Bahadur;Genome Inform,2002

3. Clique-detection models in computational biochemistry and genomics;Butenko;Eur J Oper Res,2006

4. A view invariant human FACE detection method based on maximum cliques;Hotta;Trans IPSJ,2003

5. San Segundo P, Rodríguez-Losada D, Matía F, Galán R. Fast exact feature based data correspondence search with an efficient bit-parallel MCP solver. Appl Intell 2010;32(3):311–29

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

1. Probabilistic Cellular Automata Monte Carlo for the Maximum Clique Problem;Mathematics;2024-09-13

2. Differentiating Set Intersections in Maximal Clique Enumeration by Function and Subproblem Size;Proceedings of the 38th ACM International Conference on Supercomputing;2024-05-30

3. A Differential Approach for Several NP-hard Optimization Problems;Lecture Notes in Computer Science;2024

4. Differentiable Discrete Optimization Using Dataless Neural Networks;Combinatorial Optimization and Applications;2023-12-09

5. A post-quantum associative memory;Journal of Physics A: Mathematical and Theoretical;2023-10-13