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, 2011, Number 3(13), Pages 65–79 (Mi pdm333)  

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

Applied Graph Theory

Computational aspects of treewidth for graph

V. V. Bykova

Institute of Mathematics, Siberian Federal University, Krasnoyarsk, Russia
Full-text PDF (614 kB) Citations (5)
References:
Abstract: The paper gives a brief overview of recent results on the graph treewidth problem. We investigate some of the lower and upper bounds for treewidth, and present algorithmic methods to improve these bounds.
Keywords: graph algorithms, treewidth, partial $k$-tree.
Document Type: Article
UDC: 519.178
Language: Russian
Citation: V. V. Bykova, “Computational aspects of treewidth for graph”, Prikl. Diskr. Mat., 2011, no. 3(13), 65–79
Citation in format AMSBIB
\Bibitem{Byk11}
\by V.~V.~Bykova
\paper Computational aspects of treewidth for graph
\jour Prikl. Diskr. Mat.
\yr 2011
\issue 3(13)
\pages 65--79
\mathnet{http://mi.mathnet.ru/pdm333}
Linking options:
  • https://www.mathnet.ru/eng/pdm333
  • https://www.mathnet.ru/eng/pdm/y2011/i3/p65
    Cycle of papers
    This publication is cited in the following 5 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Прикладная дискретная математика
    Statistics & downloads:
    Abstract page:305
    Full-text PDF :176
    References:58
    First page:1
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024