Dense Subgraph Discovery Meets Strong Triadic Closure

Published in ACM KDD Conference, 2024

Recommended citation: Chamalee Wickrama Arachchi, Iiro Kumpulainen, and Nikolaj Tatti. (2024). "Dense Subgraph Discovery Meets Strong Triadic Closure." ACM KDD Conference. https://dl.acm.org/doi/10.1145/3637528.3671697

Dense subgraph discovery under strong triadic closure constraints.

Download paper (GitHub)