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, supplement № 4, Pages 85–87 (Mi pdm287)  
Applied Graph Theory

Computational aspects of treewidth for graph

V. V. Bykova

Institute of Mathematics, Siberian Federal University, Krasnoyarsk
Full-text PDF (446 kB)
References:
PDF
HTML
Abstract: A brief overview of recent results on the problem of treewidth for the graph is givev; some of the lower and upper bounds for treewidth are investigated; algorithmic methods to improve these bounds are presented.
Document Type: Article
UDC: 519.178
Language: Russian
Citation: V. V. Bykova, “Computational aspects of treewidth for graph”, Prikl. Diskr. Mat., 2011, supplement № 4, 85–87
Citation in format AMSBIB
\Bibitem{Byk11}
\by V.~V.~Bykova
\paper Computational aspects of treewidth for graph
\jour Prikl. Diskr. Mat.
\yr 2011
\pages 85--87
\issueinfo supplement № 4
\mathnet{http://mi.mathnet.ru/pdm287}
Linking options:
  • https://www.mathnet.ru/eng/pdm287
  • https://www.mathnet.ru/eng/pdm/y2011/i13/p85
    Cycle of papers
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Прикладная дискретная математика
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024