GitHub / varungohil / Densest-Subgraph-Discovery

A Python repository for finding the densest subgraph in a undirected graph

JSON API: http://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/varungohil%2FDensest-Subgraph-Discovery
PURL: pkg:github/varungohil/Densest-Subgraph-Discovery

Stars: 10
Forks: 9
Open issues: 1

License: None
Language: Python
Size: 1.19 MB
Dependencies parsed at: Pending

Created at: over 7 years ago
Updated at: over 2 years ago
Pushed at: over 4 years ago
Last synced at: over 2 years ago

Topics: approximation, charikar, density, goldberg, graph-algorithms, greedy, maxflow, maxflow-mincut, networks, python

Loading...