Parameterized Aspects of Strong Subgraph Closure

Petr A. Golovach, Pinar Heggernes, Athanasios L. Konstantinidis, Paloma T. Lima, Charis Papadopoulos
2020 Algorithmica  
Motivated by the role of triadic closures in social networks, and the importance of finding a maximum subgraph avoiding a fixed pattern, we introduce and initiate the parameterized study
doi:10.1007/s00453-020-00684-9 fatcat:nhbdwiiu35hndapxu3wdxes7ou