|
|
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
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.
Citation:
V. V. Bykova, “Computational aspects of treewidth for graph”, Prikl. Diskr. Mat., 2011, no. 3(13), 65–79
Linking options:
https://www.mathnet.ru/eng/pdm333 https://www.mathnet.ru/eng/pdm/y2011/i3/p65
|
| Statistics & downloads: |
| Abstract page: | 315 | | Full-text PDF : | 181 | | References: | 63 | | First page: | 1 |
|
Citation in format AMSBIB
Contact us: