Extraction of voting networks
-
Updated
Jan 11, 2020 - R
Extraction of voting networks
builds rosters of teams which maximize a score function.
Interpretive Structural Modelling (ISM). Returns a minimum-edge hierarchical digraph following J.N. Warfield's graph partitioning algorithm.
Reconstruction of the map of Avignon during medieval times
Space of Optimal Solutions of the Correlation Clustering Problem
Benchmark to study partitioning problems on signed graphs
Multiple Partitioning of Multiplex Signed Networks
Add a description, image, and links to the graph-partitioning topic page so that developers can more easily learn about it.
To associate your repository with the graph-partitioning topic, visit your repo's landing page and select "manage topics."