Author:
Balister Paul,Bollobás Béla,Sahasrabudhe Julian,Veremyev Alexander
Funder
NSF
MULTIPLEX
AFRL Mathematical Modeling and Optimization Institute
Subject
Applied Mathematics,Discrete Mathematics and Combinatorics
Reference39 articles.
1. On maximum clique problems in very large graphs;Abello,1999
2. Massive quasi-clique detection;Abello,2002
3. An automated method for finding molecular complexes in large protein interaction networks;Bader;BMC Bioinformatics,2003
4. The minimum evolution problem is hard: a link between tree inference and graph clustering problems;Bastkowski;Bioinformatics,2015
5. Statistical analysis of financial networks;Boginski;Comput. Stat. Data Anal.,2005
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献