RUS  ENG
Full version
JOURNALS // Prikladnaya Diskretnaya Matematika // Archive
Prikl. Diskr. Mat., 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

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.

UDC: 519.178


© Steklov Math. Inst. of RAS, 2024