3 research outputs found
Graph Parameters, Universal Obstructions, and WQO
We introduce the notion of universal obstruction of a graph parameter, with
respect to some quasi-ordering relation. Universal obstructions may serve as
compact characterizations of the asymptotic behavior of graph parameters. We
provide order-theoretic conditions which imply that such a characterization is
finite and, when this is the case, we present some algorithmic implications on
the existence of fixed-parameter algorithms