Showing 2025Show all
2 papers · 1 filter
cs.DM2025
Near-optimal edge partitioning via intersecting families
Alexander Yakunin, Andrey Kupavskii, Alexander Sushin +1
We study the problem of edge partitioning, where the goal is to partition the edge set of a graph into parts. The replication factor of a vertex is the number of parts that…
cs.SI2025
LD-Leiden: Local Parallel Community Detection in Large Dynamic Networks
Grigoriy Bokov, Aleksandr Konovalov, Anna Uporova +3
Dynamic community detection must update high-quality modularity partitions after edge batches, yet full Leiden reruns make small changes scale with the whole snapshot. Existing dyn…