Heuristics to Find Maximum Independent Set: An Overview-Reference-Cited by-同舟云学术

Heuristics to Find Maximum Independent Set: An Overview

Published:2012 Issue: Volume: Page:881-892
ISSN:1867-5662
Container-title:Advances in Intelligent and Soft Computing
language:
Short-container-title:

Author:

Das Kedar Nath,Chaudhuri Biplab

Publisher

Springer India

Link

http://link.springer.com/content/pdf/10.1007/978-81-322-0487-9_83

Reference22 articles.

1. Aarts, E., Korst, J.: Simulated Annealing and Boltzmann Machines. J. Wiley & Sons, Chichester (1989)

2. Aggarwal, C.C., Orlin, J.B., Tai, R.P.: Optimized crossover for the independent set problem. Operations Research 45(2), 226–234 (1997)

3. Back, T., Khuri, S.: An evolutionary heuristic for the maximum independent set problem. In: Proceedings of the IEEE Conference on Evolutionary Computation, vol. 2, pp. 531–535 (1994)

4. Barbosa, V.C., Campos, L.C.D.: A Novel Evolutionary Formulation of the Maximum Independent Set Problem. Journal of Combinatorial Optimization 8(4), 419–437 (2004)

5. Burke, L.I.: A neural design for solution of the maximal independent set problem. European Journal of Operational Research 62(2), 186–193 (1992)

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

1. Simple iterative trial search for the maximum independent set problem optimized for the GPUs;Concurrency and Computation: Practice and Experience;2021-11-08

2. Neural Maximum Independent Set;Communications in Computer and Information Science;2021

3. Empirical Evaluation of Approximation Algorithms for Generalized Graph Coloring and Uniform Quasi-wideness;ACM Journal of Experimental Algorithmics;2019-12-17