Parameterized Aspects of Strong Subgraph Closure

28 Feb 2018 Golovach Petr A. Heggernes Pinar Konstantinidis Athanasios L. Lima Paloma T. Papadopoulos Charis

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 of the Strong F-closure problem, where F is a fixed graph. This is a generalization of Strong Triadic Closure, whereas it is a relaxation of F-free Edge Deletion... (read more)

PDF Abstract
No code implementations yet. Submit your code now

Categories


  • DATA STRUCTURES AND ALGORITHMS
  • DISCRETE MATHEMATICS

Datasets


  Add Datasets introduced or used in this paper