Prikl. Diskr. Mat. Suppl., 2012, Issue 5, Pages 102–104
Mathematical Foundations of Informatics and Programming
Methods for designing FPT-algorithms on graphs of limited treewidth
V. V. Bykova
Institute of Mathematics, Siberian Federal University, Krasnoyarsk
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.
PDF file (401 kB)
V. V. Bykova, “Methods for designing FPT-algorithms on graphs of limited treewidth”, Prikl. Diskr. Mat. Suppl., 2012, no. 5, 102–104
Citation in format AMSBIB
\paper Methods for designing FPT-algorithms on graphs of limited treewidth
\jour Prikl. Diskr. Mat. Suppl.
Citing articles on Google Scholar:
Related articles on Google Scholar:
|Number of views:|