Detecting strong cliques in co-authorship networks

DOI10.1007/978-3-031-53499-7_16MaRDI QIDQ6621420

Eliska Ochodkova, Lukas Papik, Miloš Kudĕlka

Publication date: 18 October 2024

zbMATH Keywords

weighted networkstrong cliqueco-authorship networkclique detection

Mathematics Subject Classification ID

Computer science (68-XX)

Cites Work

• Unnamed Item
• Efficient clustering of large uncertain graphs using neighborhood information
• Fast algorithms for determining (generalized) core groups in social networks
• Networks
• Algorithm 457: finding all cliques of an undirected graph

This page was built for publication: Detecting strong cliques in co-authorship networks