RUS  ENG
Full version
JOURNALS // Prikladnaya Diskretnaya Matematika // Archive
Prikl. Diskr. Mat., 2011 Number 3(13), Pages 65–79 (Mi pdm333)
This article is cited 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.

UDC: 519.178


© Steklov Math. Inst. of RAS, 2024