Exact MIP-based approaches for finding maximum quasi-cliques and dense subgraphs
- 21 November 2015
- journal article
- research article
- Published by Springer Nature in Computational Optimization and Applications
- Vol. 64 (1) , 177-214
Abstract
No abstract availableKeywords
Funding Information
- Air Force Office of Scientific Research (FA8651-14-2-0002)
- Air Force Office of Scientific Research (FA9550-12-1-0103)
- Air Force Office of Scientific Research (FA8651-12-2-0011)
This publication has 43 references indexed in Scilit:
- Dense Percolation in Large-Scale Mean-Field Random Networks Is Provably “Explosive”PLOS ONE, 2012
- A branch-and-bound approach for maximum quasi-cliquesAnnals of Operations Research, 2012
- Editing Graphs into Disjoint Unions of Dense ClustersAlgorithmica, 2011
- The abundance threshold for plague as a critical percolation phenomenonNature, 2008
- Mining coherent dense subgraphs across massive biological networks for functional discoveryBioinformatics, 2005
- The Spectra of Random Graphs with Given Expected DegreesInternet Mathematics, 2004
- Protein complexes and functional modules in molecular networksProceedings of the National Academy of Sciences, 2003
- Complexity of finding dense subgraphsDiscrete Applied Mathematics, 2002
- A fast algorithm for the maximum clique problemDiscrete Applied Mathematics, 2002
- The maximum clique problemJournal of Global Optimization, 1994