Page Content
Detecting Connected Components and Communities in Hypergraphs
From this page you can download the algorithm for
decomposing a
3-partite 3-uniform hypergraph stored in a database
into its
normal and hyperincident connected components.
hcc.zip [1]
If you use this software, please cite:
Also, you
can download several software packages for
multi-partite
community detection in hypergraphs.
mpcd
(Multi-Partite Community Detection)
performs community detection based on multi-partite modularity
optimization.
mpcd.zip [3]
mpcb (Multi-Partite Community
Benchmarking)
evaluates community detection algorithms based on three
different
families of synthetic benchmark hypergraphs.
mpcb.zip [4], with data: mpcb_with_data.zip [5]
mpce (Multi-Partite Community
Exploration)
allows for the interactive exploration of community detection
results such as the ones provided by mpcd.
mpce.zip [6]
If you use this software, please cite:
e/DCCCH/hcc.zip
/communities_in_hypergraphs/parameter/en/font2/maxhilfe
/?tx_sibibtex_pi1%5Bcontentelement%5D=tt_content%3A4472
44&tx_sibibtex_pi1%5BshowUid%5D=1166661&cHash=2
dd6d74e72498e8ea5d25156a8e36186
e/DCCCH/mpcd.zip
e/DCCCH/mpcb.zip
e/DCCCH/mpcb_with_data.zip
e/DCCCH/mpce.zip
/communities_in_hypergraphs/parameter/en/font2/maxhilfe
/?tx_sibibtex_pi1%5Bcontentelement%5D=tt_content%3A4472
46&tx_sibibtex_pi1%5BshowUid%5D=1166659&cHash=6
6bed1011777b8b9cf712b592561ecbd
parameter/en/font2/maxhilfe/id/119100/?no_cache=1&a
sk_mail=Yr7HGQAMa%2FPi9K0fSxDyP%2FtB2Ib9PE6oBVP4YLa2Sud
4u2XjYcquoA%3D%3D&ask_name=NICOLAS%20NEUBAUER