2 papers
cs.DS2025
The Densest SWAMP problem: subhypergraphs with arbitrary monotonic partial edge rewards
Vedangi Bengali, Nikolaj Tatti, Iiro Kumpulainen +2
We consider a generalization of the densest subhypergraph problem where nonnegative rewards are given for including partial hyperedges in a dense subhypergraph. Prior work addresse…
cs.SI2024
From your Block to our Block: How to Find Shared Structure between Stochastic Block Models over Multiple Graphs
Iiro Kumpulainen, Sebastian Dalleiger, Jilles Vreeken +1
Stochastic Block Models (SBMs) are a popular approach to modeling single real-world graphs. The key idea of SBMs is to partition the vertices of the graph into blocks with similar…