157 citations · 421 across the 63 of their papers we have counts for
3 papers · 1 filter
Faster Local Motif Clustering via Maximum Flows
Adil Chhabra, Marcelo Fonseca Faraj, Christian Schulz
Local clustering aims to identify a cluster within a given graph that includes a designated seed node or a significant portion of a group of seed nodes. This cluster should be well…
Local Motif Clustering via (Hyper)Graph Partitioning
Adil Chhabra, Marcelo Fonseca Faraj, Christian Schulz
A widely-used operation on graphs is local clustering, i.e., extracting a well-characterized community around a seed node without the need to process the whole graph. Recently loca…
Visualizing spreading phenomena on complex networks
Christian Schulz
Graph drawings are useful tools for exploring the structure and dynamics of data that can be represented by pair-wise relationships among a set of objects. Typical real-world socia…