A densest subgraph approach that builds on the greedy technique
FraudHunt/DSG
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
About
A densest subgraph based solution to partition co-review graphs into worker controlled components.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published