Exhaustive community enumeration in parallel

DOI10.1142/S0129626416500067MaRDI QIDQ4598918zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Christian Trefftz, Hugh McGuire, Zachary Kurmas, Jerry Scripps

Publication date 15 December 2017

Published in Parallel Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s0129626416500067

zbMATH Keywords

community findingexhaustive enumerationunrank

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10)

Recommendations

• Parallel community detection for massive graphs
• A general view on computing communities
• Modularity-maximizing graph communities via mathematical programming
• Parallel maximum clique algorithms with applications to network analysis
• Parallel enumeration of degree sequences of simple graphs

Cited in

(1)

• Parallel community detection for massive graphs

This page was built for publication: Exhaustive community enumeration in parallel

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4598918)