2 citations · 2 across the 1 of their papers we have counts for
2 papers
cs.DS2023
Scalable Edge Clustering of Dynamic Graphs via Weighted Line Graphs
Michael Ostroski, Geoffrey Sanders, Trevor Steil +1
Timestamped relational datasets consisting of records between pairs of entities are ubiquitous in data and network science. For applications like peer-to-peer communication, email,…
cs.SI2016★ 2 cited
Detecting highly cyclic structure with complex eigenpairs
Christine Klymko, Geoffrey Sanders
Many large, real-world complex networks have rich community structure that a network scientist seeks to understand. These communities may overlap or have intricate internal structu…