Chain Minors Are FPT

@inproceedings{Blasiok2013ChainMA,
  title={Chain Minors Are FPT},
  author={Jaroslaw Blasiok and M. Kaminski},
  booktitle={IPEC},
  year={2013}
}
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 C Q in Q with the property that f restricted to C Q is an isomorphism of chains. 
1 Citations
Well-Quasi-Orderings and the Robertson–Seymour Theorems
TLDR
Well-quasi-orderings (WQOs) provide a powerful engine for demonstrating that classes of problems are FPT and applications to combinatorial problems are examined. Expand

References

SHOWING 1-9 OF 9 REFERENCES
Well Quasi Ordering Finite Posets and Formal Languages
  • J. Gustedt
  • Computer Science, Mathematics
  • J. Comb. Theory, Ser. B
  • 1995
We show that the set of finite posets is a well-quasi-ordering with respect to a certain relation ?, called the chain minor relation. To prove this we introduce a similar relation on finite formalExpand
Algorithmic Aspects of Ordered Structures
TLDR
A general 0-1-law for hereditary properties that has implications for average-case complexity is given and it is obtained that a wide class of problems, including e.g. perfectness, has average constant time algorithms. Expand
Parameterized Complexity
TLDR
An approach to complexity theory which offers a means of analysing algorithms in terms of their tractability, and introduces readers to new classes of algorithms which may be analysed more precisely than was the case until now. Expand
Color-coding
TLDR
A novel randomized method, the method of color-coding for finding simple paths and cycles of a specified length k, and other small subgraphs, within a given graph G = (V,E), which can be derandomized using families of perfect hash functions. Expand
FPT Suspects and Tough Customers: Open Problems of Downey and Fellows
  • F. Fomin, D. Marx
  • Computer Science
  • The Multivariate Algorithmic Revolution and Beyond
  • 2012
We give an update on the status of open problems from the book "Parameterized Complexity" by Downey and Fellows.
Splitters and near-optimal derandomization
TLDR
A fairly general method for finding deterministic constructions obeying k-restrictions, which yields structures of size not much larger than the probabilistic bound and imply the very efficient derandomization of algorithms in learning, of fixed-subgraph finding algorithms, and of near optimal /spl Sigma/II/Spl Sigma/ threshold formulae. Expand
Color Coding
TLDR
These findings suggest that a reliable unidimensional hue code should not contain more than about tight optimally spaced stimuli, whereas color codes are valuable in decreasing search-time with locate-type tasks. Expand
A combinatorial approach to obtain bounds for stochastic project
  • networks. Tech. report, Technische Universität Berlin,
  • 1992
A combinatorial approach to obtain bounds for stochastic project networks
  • 1992