Author:
Komusiewicz Christian,Sorge Manuel,Stahl Kolja
Publisher
Springer International Publishing
Reference14 articles.
1. Abello, J., Pardalos, P.M., Resende, M.G.C.: On maximum clique problems in very large graphs. In: External Memory Algorithms and Visualization, vol. 50 of DIMACS, pp. 119–130. AMS (1999)
2. Lecture Notes in Computer Science;J Abello,2002
3. Bader, G.D., Hogue, C.W.: An automated method for finding molecular complexes in large protein interaction networks. BMC Bioinformatics 4(1), 2 (2003)
4. Balasundaram, B., Pajouh, F.M.: Graph theoretic clique relaxations and applications. In: Handbook of Combinatorial Optimization, pp. 1559–1598. Springer (2013)
5. Boginski, V., Butenko, S., Pardalos, P.M.: On structural properties of the market graph. In: Innovations in Financial and Economic Networks. New Dimensions in Networks, pp. 29–45. Edward Elgar Publishing, Cheltenham, England (2003)
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献