Prikladnaya Diskretnaya Matematika
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Prikl. Diskr. Mat.:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Prikladnaya Diskretnaya Matematika, 2012, Number 2(16), Pages 65–78 (Mi pdm361)  

This article is cited in 4 scientific papers (total in 4 papers)

Mathematical Foundations of Informatics and Programming

FPT-algorithms on graphs of limited treewidth

V. V. Bykova

Institute of Mathematics, Siberian Federal University, Krasnoyarsk
References:
Abstract: 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.
Keywords: graph algorithms, tree decomposition, dynamic programming.
Document Type: Article
UDC: 519.178
Language: Russian
Citation: V. V. Bykova, “FPT-algorithms on graphs of limited treewidth”, Prikl. Diskr. Mat., 2012, no. 2(16), 65–78
Citation in format AMSBIB
\Bibitem{Byk12}
\by V.~V.~Bykova
\paper FPT-algorithms on graphs of limited treewidth
\jour Prikl. Diskr. Mat.
\yr 2012
\issue 2(16)
\pages 65--78
\mathnet{http://mi.mathnet.ru/pdm361}
Linking options:
  • https://www.mathnet.ru/eng/pdm361
  • https://www.mathnet.ru/eng/pdm/y2012/i2/p65
  • This publication is cited in the following 4 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Прикладная дискретная математика
    Statistics & downloads:
    Abstract page:428
    Full-text PDF :175
    References:88
    First page:1
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024