search

UMD-ARLIS / Graph-Benchmarking-Project

This repository contains work towards creating a comprehensive cross-platform graph processing benchmark for Community Detection and Subgraph Isomorphism problems. The repository is NOT YET COMPLETE and should not be used outside of a preliminary development perspective.
2 stars 0 forks source link

Community Detection Complexity. #9

Open osullik opened 12 months ago

osullik commented 12 months ago

As a data-generator developer, I need a summary of the complexities and worst-case input data shapes for popular community detection algorithms so that I can identify the key (common) factors that will make for meaningful changes in 'difficulty' of a generated graph.

osullik commented 12 months ago

This is done when I have

  1. a table that lists at least 15 popular community detection algorithms, groups them into families, has a verified estimate of their complexity, has a description of the "worst-case" input data and has an attached citation.
  2. This MAY be extended by including reported 'baseline' performance metrics for each algorithm.
osullik commented 11 months ago

About ~15 papers in. ~30 to go.