Q5875555
type: Item
instance of: scholarly article
author: Edin Husić
author: Stéphan Thomassé
author: Nicolas Trotignon
publication date: 2023-02-03T00:00:00Z
full work available at URL: https://arxiv.org/abs/1907.01083
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68Q27
Mathematics Subject Classification ID: 68Wxx
zbMATH DE Number: 7650229
zbMATH Keywords: independent set
zbMATH Keywords: FPT algorithm
zbMATH Keywords: even-hole-free graph
zbMATH Keywords: augmenting graph
MaRDI profile type: Publication
DOI: 10.4230/LIPICS.IPEC.2019.21
Recommended article: Independent Set in P5-Free Graphs in Polynomial Time
Recommended article: Parameterized inapproximability of independent set in \(H\)-free graphs
Recommended article: Parameterized Complexity of Independent Set in H-Free Graphs.
Recommended article: Parameterized complexity of independent set in H-free graphs
Recommended article: A polynomial-time algorithm for the Independent Set problem in \(\{{P_{10}},C_4,C_6\}\)-free graphs
Recommended article: Structural Information and Communication Complexity
Recommended article: On the complexity of the independent set problem in triangle graphs
Recommended article: Polynomial-time solvability of the independent set problem in a certain class of subcubic planar graphs
Recommended article: Q3115672
description: scientific article; zbMATH DE number 7650229