Author:
Boginski Vladimir,Butenko Sergiy,Pardalos Panos M.
Subject
Applied Mathematics,Computational Theory and Mathematics,Computational Mathematics,Statistics and Probability
Reference25 articles.
1. Abello, J., Pardalos, P.M., Resende, M.G.C., 1999. On Maximum Clique Problems in very Large Graphs. DIMACS Series, Vol. 50. American Mathematical Society, Providence, RI, pp. 119–130.
2. A random graph model for power law graphs;Aiello;Exp. Math,2001
3. Statistical mechanics of complex networks;Albert;Rev. Mod. Phys,2002
4. Arora, S., Safra, S., 1992. Approximating clique is NP-complete. Proceedings of the 33rd IEEE Symposium on Foundations on Computer Science, pp. 2–13.
5. Economic Applications of the Theory of Graphs;Avondo-Bodino,1962
Cited by
302 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献