Symmetry-breaking symmetry in directed spectral partitioning
By: Dimosthenis Pasadakis , Raphael S. Steiner , Pál András Papp and more
Potential Business Impact:
Organizes computer data much faster and better.
We break the symmetry in classical spectral bi-partitioning in order to incentivise the alignment of directed cut edges. We use this to generate acyclic bi-partitions and furthermore topological orders of directed acyclic graphs with superb locality. The new approach outperforms the state-of-the-art Gorder algorithm by up to $17\times$ on total reuse distance and minimum linear arrangement.
Similar Papers
Reweighted Spectral Partitioning Works: Bounds for Special Graph Classes
Data Structures and Algorithms
Finds better ways to cut networks apart.
Asymmetry in Spectral Graph Theory: Harmonic Analysis on Directed Networks via Biorthogonal Bases (Adjacency-Operator Formulation)
Rings and Algebras
Analyzes messy networks by finding hidden patterns.
Online Sparsification of Bipartite-Like Clusters in Graphs
Data Structures and Algorithms
Finds groups of connected things faster.