Short cycles make \(W\)-hard problems hard: FPT algorithms for \(W\)-hard problems in graphs with no short cycles

DOI10.1007/S00453-007-9148-9zbMATH Open1170.68019OpenAlexW2030711914MaRDI QIDQ958211

Author name not available (Why is that?)

Publication date: 2 December 2008

Published in: (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-007-9148-9

zbMATH Keywords

No records found.

Mathematics Subject Classification ID

No records found.

This page was built for publication: Short cycles make \(W\)-hard problems hard: FPT algorithms for \(W\)-hard problems in graphs with no short cycles

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