'Parameterized complexity' diaporamas de présentation

A Beginner in Parameterized Complexity

A Beginner in Parameterized Complexity. Jian Li Fudan University May,2006. OUTLINE. Brief introduction Using vertex cover as a paradigm. Fixed parameter tractability Bounded search tree method Problem kernel method Method via automata and bounded treewidth WQO and graph minor theorem.

694 views • 41 slides

Introduction and overview of FPT algorithmics

478 views • 30 slides

Joint work with Hans Bodlaender

Bart Jansen Vertex Cover Kernelization Revisited: Upper and Lower Bounds for a Refined Parameter. Joint work with Hans Bodlaender. STACS 2011, Dortmund March 10 th , 2011. Vertex Cover. Input: Graph G, integer k Question: Does G have a vertex cover of size ? k?.

337 views • 24 slides

Bart Jansen Vertex Cover Kernelization Revisited: Upper and Lower Bounds for a Refined Parameter

Bart Jansen Vertex Cover Kernelization Revisited: Upper and Lower Bounds for a Refined Parameter. Joint work with Hans Bodlaender. STACS 2011, Dortmund March 10 th , 2011. Vertex Cover. Input: Graph G, integer k Question: Does G have a vertex cover of size ? k?.

323 views • 24 slides

392 views • 21 slides