1.3k citations · 2.2k across the 67 of their papers we have counts for
3 papers · 1 filter
Densest Subhypergraph: Negative Supermodular Functions and Strongly Localized Methods
Yufan Huang, David F. Gleich, Nate Veldt
Dense subgraph discovery is a fundamental primitive in graph and hypergraph analysis which among other applications has been used for real-time story detection on social media and…
Parameterized Correlation Clustering in Hypergraphs and Bipartite Graphs
Nate Veldt, Anthony Wirth, David F. Gleich
Motivated by applications in community detection and dense subgraph discovery, we consider new clustering objectives in hypergraphs and bipartite graphs. These objectives are param…
Unifying Sparsest Cut, Cluster Deletion, and Modularity Clustering Objectives with Correlation Clustering
Nate Veldt, David Gleich, Anthony Wirth
Graph clustering, or community detection, is the task of identifying groups of closely related objects in a large network. In this paper we introduce a new community-detection fram…