scientific article; zbMATH DE number 7650229

DOI10.4230/LIPICS.IPEC.2019.21MaRDI QIDQ5875555

Edin Husić, Steéphan Thomassé, Nicolas Trotignon

Publication date: 3 February 2023

Full work available at URL: https://arxiv.org/abs/1907.01083

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

independent setFPT algorithmaugmenting grapheven-hole-free graph

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Algorithms in computer science (68Wxx) Parameterized complexity, tractability and kernelization (68Q27)

Related Items (2)

Finding a shortest even hole in polynomial time ⋮ Unnamed Item

This page was built for publication: