Geodesic
Methods for designing FPT-algorithms on graphs of limited treewidth
Prikladnaya Diskretnaya Matematika. Supplement, no. 5 (2012), pp. 102-104

Voir la notice de l'article provenant de la source Math-Net.Ru

A method for designing FPT-algorithms by means of dynamic programming based on the tree decomposition is investigated. Some problems limiting the application of this method in practice are pointed. The problem of memory is solved by using a binary tree decomposition of the separator, which reduces the theoretical and the actual size of the dynamic programming tables. The technique of tables in the language of relational algebra is described. 
@article{PDMA_2012_5_a54,
     author = {V. V. Bykova},
     title = {Methods for designing {FPT-algorithms} on graphs of limited treewidth},
     journal = {Prikladnaya Diskretnaya Matematika. Supplement},
     pages = {102--104},
     publisher = {mathdoc},
     number = {5},
     year = {2012},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/PDMA_2012_5_a54/}
}
TY  - JOUR
AU  - V. V. Bykova
TI  - Methods for designing FPT-algorithms on graphs of limited treewidth
JO  - Prikladnaya Diskretnaya Matematika. Supplement
PY  - 2012
SP  - 102
EP  - 104
IS  - 5
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/PDMA_2012_5_a54/
LA  - ru
ID  - PDMA_2012_5_a54
ER  - 
%0 Journal Article
%A V. V. Bykova
%T Methods for designing FPT-algorithms on graphs of limited treewidth
%J Prikladnaya Diskretnaya Matematika. Supplement
%D 2012
%P 102-104
%N 5
%I mathdoc
%U http://geodesic.mathdoc.fr/item/PDMA_2012_5_a54/
%G ru
%F PDMA_2012_5_a54
V. V. Bykova. Methods for designing FPT-algorithms on graphs of limited treewidth. Prikladnaya Diskretnaya Matematika. Supplement, no. 5 (2012), pp. 102-104. http://geodesic.mathdoc.fr/item/PDMA_2012_5_a54/