2013/04/22 by Jarosław Błasiok, Jaroslaw Blasiok, Marcin Kamiński +3 · 1 citation
Computer Science · Mathematics · #Advanced Combinatorial Mathematics #Advanced Graph Theory Research #Complexity and Algorithms in Graphs #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #cs.DM #cs.DS
paper · pdf · doi:10.48550/arxiv.1304.5849
arxiv created 2013/04/22 · openalex publication_date 2013/04/22 · arxiv updated 2013/04/23 · openalex created_date 2019/06/27 · openalex updated_date 2026/07/28
Given two finite posets P and Q, P is a chain minor of Q if there exists a partial function f from the elements of Q to the elements of P such that for every chain in P there is a chain CQ in Q with the property that f restricted to CQ is an isomorphism of chains. We give an algorithm to decide whether a poset P is a chain minor of o poset Q that runs in time O(|Q| log |Q|) for every fixed poset P. This solves an open problem from the monograph by Downey and Fellows [Parameterized Complexity, 1999] who asked whether the problem was fixed parameter tractable.