From Stars to Diamonds: Counting and Listing Almost Complete Subgraphs in Large Networks

• Published in: Computer journal Vol. 67; no. 6; pp. 2151 - 2161
• Main Authors: Finocchi, Irene, Garcia, Renan Leon, Sinaimeri, Blerina
• Format: Journal Article
• Language: English
• Published: Oxford University Press 24.06.2024
• Subjects: graph mining; clique relaxations; distributed algorithms; enumeration algorithms; dense subgraphs; MapReduce
• ISSN: 0010-4620; 1460-2067
• DOI: 10.1093/comjnl/bxad129

Listing dense subgraphs is a fundamental task with a variety of network analytics applications. A lot of research has been done focusing on $k$-cliques, i.e. complete subgraphs on $k$ nodes. However, requiring complete connectivity between the nodes of a subgraph may be too restrictive in many real...