Skew-Symmetric Adjacency Matrices for Clustering Directed Graphs

Koby Hayashi, Sinan G. Aksoy, Haesun Park

Cut-based directed graph (digraph) clustering often focuses on finding dense within-cluster or sparse between-cluster connections, similar to cut-based undirected graph clustering…