Complexity framework for forbidden subgraphs. I: The framework

DOI10.1007/S00453-024-01289-2MaRDI QIDQ7022268zbMATH OpenFDO

Authors Matthew Johnson, Barnaby Martin, Jelle J. Oostveen, Sukanya Pandey, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen

Publication date 25 February 2025

Published in Algorithmica (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

zbMATH Keywords

treewidthcomplexity dichotomyforbidden subgraphmeta-classification

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

This page was built for publication: Complexity framework for forbidden subgraphs. I: The framework

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7022268)