Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
Complexity of the cluster vertex deletion problem on \(H\)-free graphs - MaRDI portal

Complexity of the cluster vertex deletion problem on \(H\)-free graphs

From MaRDI portal

Publication:6584072

Jump to:navigation, search

DOI10.4230/lipics.mfcs.2022.68MaRDI QIDQ6584072

Bang le van, Hoàng-Oanh Le

Publication date: 6 August 2024

zbMATH Keywords

computational complexity vertex cover cluster vertex deletion complexity dichotomy

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (1)

The complexity of \((P_k, P_\ell ) \)-arrowing

This page was built for publication: Complexity of the cluster vertex deletion problem on \(H\)-free graphs

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:6584072&oldid=40123682"