Suchergebnisse - Parameterized Complexity Algorithms Graph Algorithms Strong Triadic Closure Bayesian Networks

Maximum Edge-Colorable Subgraph and Strong Triadic Closure Parameterized by Distance to Low-Degree Graphs von Grüttemeier, Niels, Komusiewicz, Christian, Morawietz, Nils

“… \), we also provide a linear-size kernel for the same parameterization for Multi Strong Triadic Closure, a related edge coloring problem with applications in social network analysis …”
Volltext