Author:
Batsyn Mikhail,Goldengorin Boris,Maslov Evgeny,Pardalos Panos M.
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computational Theory and Mathematics,Control and Optimization,Discrete Mathematics and Combinatorics,Computer Science Applications
Reference31 articles.
1. Andrade DV, Resende MGC, Werneck RF (2012) Fast local search for the maximum independent set problem. J Heuristics 18(4):525–547. doi: 10.1007/s10732-012-9196-4
2. Balas E, Yu CS (1986) Finding a maximum clique in an arbitrary graph. SIAM J Comput 15(4):1054–1068
3. Bertoni A, Campadelli P, Grossi G (1997) A discrete neural algorithm for the maximum clique problem: analysis and circuit implementation. In: Proceedings of workshop on algorithm, engineering, WAE’97, pp 84–91
4. Boginski V, Butenko S, Pardalos PM (2003) Innovations in financial and economic networks. In: Nagurney A (ed) On structural properties of the market graph. Edward Elgar Publishing, London, pp 29–45
5. Bomze I, Budinich MPMP, Pelillo M (1999) The maximum clique problem. In: Handbook of combinatorial optimization. Kluwer Academic Publishers, Boston
Cited by
34 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献