3 papers
cs.SI2026
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…
cs.DM2026
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.DS2026
Algorithms for Standard-form ILP Problems via Komlós' Discrepancy Setting
Dmitry Gribanov, Tagir Khayaleyev, Mikhail Cherniavskii +3
We study the standard-form ILP problem , where has full row rank. We obtain refined FPT algorithms par…