Chain minors are FPT

DOI10.1007/978-3-319-03898-8_8zbMATH Open1407.68204OpenAlexW2153926117MaRDI QIDQ2867074FDOQ2867074

Authors: Jarosław Błasiok, Marcin Kamiński 

Publication date: 10 December 2013

Published in: Parameterized and Exact Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-03898-8_8

Recommendations

• Chain minors are FPT
• scientific article; zbMATH DE number 475611
• Quantified conjunctive queries on partially ordered sets
• scientific article; zbMATH DE number 108280
• First-Fit is linear on posets excluding two long incomparable chains

zbMATH Keywords

algorithmsdata structuresparameterized complexitypartially ordered sets

Mathematics Subject Classification ID

Partial orders, general (06A06) Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05)

Cited In (1)

• Chain minors are FPT

This page was built for publication: Chain minors are FPT

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