Search Results - Parameterized Complexity Algorithms Graph Algorithms Strong Triadic Closure Bayesian Networks

  • Showing 1 - 1 results of 1
Refine Results
  1. 1
    Cover Image

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

    ISSN: 2331-8422
    Published: Ithaca Cornell University Library, arXiv.org 20.02.2020
    Published in arXiv.org (20.02.2020)
    “…\), 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…”
    Get full text
    Paper
    Save to List
    Saved in:

Search Tools: