A puzzle that has long flummoxed computers and the scientists who program them has suddenly become far more manageable. A new algorithm efficiently solves the graph isomorphism problem, computer ...

This is a graduate topics course on learning in networks, focusing in particular on fundamental statistical and computational limits. Topics include the planted clique problem, community detection, ...

This is a preview. Log in through your library . Abstract This paper introduces and studies the maximum k-plex problem, which arises in social network analysis and has wider applicability in several ...