Efficiently covering complex networks with cliques of similar vertices
- 6 April 2006
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 355 (1), 37-47
- https://doi.org/10.1016/j.tcs.2005.12.005
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Comparison of 2D Similarity and 3D Superposition. Application to Searching a Conformational Drug Database.ChemInform, 2004
- Comparison of 2DSimilarity and 3DSuperposition. Application to Searching a Conformational Drug DatabaseJournal of Chemical Information and Computer Sciences, 2004
- Bipartite structure of all complex networksInformation Processing Letters, 2004
- The vertex degree distribution of random intersection graphsRandom Structures & Algorithms, 2004
- Accelerating screening of 3D protein data with a graph theoretical approachBioinformatics, 2003
- Random graphs with arbitrary degree distributions and their applicationsPhysical Review E, 2001
- Random intersection graphs whenm=?(n): An equivalence theorem relating the evolution of theG(n,m,p) andG(n,p) modelsRandom Structures & Algorithms, 2000
- On Random Intersection Graphs: The Subgraph ProblemCombinatorics, Probability and Computing, 1999
- Random interval graphsCombinatorica, 1988