Asymptotic bounds for clustering problems in random graphs
From MaRDI portal
Publication:6196888
DOI10.1002/net.22203MaRDI QIDQ6196888
Sergiy I. Butenko, Pavlo A. Krokhmal, Eugene Lykhovyd
Publication date: 15 March 2024
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.22203
network analysis; asymptotic bounds; independent union of cliques; uniform random graphs; network clusterability
68-XX: Computer science