Large-scale clique cover of real-world networks
Authors:
- Alessio ConteACAlessio Conte
- Roberto GrossiRGRoberto Grossi
- Andrea MarinoAMAndrea Marino
- 1 February 2020
- journal article
- conference paper
- Published by Elsevier in Information and Computation
- Vol. 270
Abstract
No abstract availableKeywords
Funding Information
- Japan Science and Technology Agency
This publication has 19 references indexed in Scilit:
- Finding maximal cliques in massive networksACM Transactions on Database Systems, 2011
- Data reduction and exact algorithms for clique coverACM Journal of Experimental Algorithmics, 2009
- The worst-case time complexity for generating all maximal cliques and computational experimentsTheoretical Computer Science, 2006
- Efficiently covering complex networks with cliques of similar verticesTheoretical Computer Science, 2006
- An Algorithm for a Letter-Based Representation of All-Pairwise ComparisonsJournal of Computational and Graphical Statistics, 2004
- On the hardness of approximating minimization problemsJournal of the ACM, 1994
- Linear time algorithms on circular-arc graphsInformation Processing Letters, 1991
- Informant accuracy in social network data IV: a comparison of clique-level structure in behavioral and cognitive network dataSocial Networks, 1979
- Covering edges by cliques with regard to keyword conflicts and intersection graphsCommunications of the ACM, 1978
- Algorithm 457: finding all cliques of an undirected graphCommunications of the ACM, 1973