Lower bounds on paraclique density
- 1 May 2016
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 204, 208-212
Abstract
No abstract availableKeywords
Funding Information
- National Institutes of Health (P20MD000516, R01AA018776)
This publication has 7 references indexed in Scilit:
- CbGRiTS: Cerebellar gene regulation in time and spaceDevelopmental Biology, 2015
- A systematic comparison of genome-scale clustering algorithmsBMC Bioinformatics, 2012
- Genetic Dissection of Acute Ethanol Responsive Gene Networks in Prefrontal Cortex: Functional and Mechanistic ImplicationsPLOS ONE, 2012
- Graph Algorithms for Integrated Biological Analysis, with Applications to Type 1 Diabetes Data2009
- Scalable Parallel Algorithms for FPT ProblemsAlgorithmica, 2006
- Uncovering the overlapping community structure of complex networks in nature and societyNature, 2005
- Algorithm 457: finding all cliques of an undirected graphCommunications of the ACM, 1973