LiuXin11235/segmentation-meets-densest-subgraph

segmentation-meets-densest-subgraph

Scripts and datasets used for experiments included in paper:

Polina Rozenshtein, Francesco Bonchi, Aristides Gionis, Mauro Sozio and Nikolaj Tatti, "Finding events in temporal networks: Segmentation meets densest-subgraph discovery", ICDM'18

Referencies:

• https://networkx.github.io/
• https://pypi.python.org/pypi/fibonacci-heap-mod
• https://github.com/ikegami-yukino/madoka-python