Cover Image

The Parameterized Complexity of Independent Set and More when Excluding a Half-Graph, Co-Matching, or Matching

Fuente: arXiv
Saved in:
Bibliographic Details
Main Authors: Dreier, Jan, Mählmann, Nikolas, Siebertz, Sebastian
Format: Preprint
Published: 2026
Subjects:
Computational Complexity
Discrete Mathematics
Data Structures and Algorithms
Online Access:
Acceder al recurso
Tags: Add Tag
No Tags, Be the first to tag this record!
Be the first to leave a comment!
You must be logged in first

Similar Items