The balanced graph partitioning problem in the dynamic setting is known as streaming graph partitioner SGP. This project provides a graph partioner algorithm for the problem of SGP, especially when the nature of the graph is characterized by social interactions.
-
Notifications
You must be signed in to change notification settings - Fork 2
The balanced graph partitioning problem in the dynamic setting is known as streaming graph partitioner SGP. This project provides a graph partioner algorithm for the problem of SGP, especially when the nature of the graph is characterized by social interactions.
License
isislab-unisa/streaminggraphpartitioning
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
About
The balanced graph partitioning problem in the dynamic setting is known as streaming graph partitioner SGP. This project provides a graph partioner algorithm for the problem of SGP, especially when the nature of the graph is characterized by social interactions.
Resources
License
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published