scientific article; zbMATH DE number 7310159

zbMath1478.68221MaRDI QIDQ5150524

Valentina Vladimirovna Bykova

Publication date: 15 February 2021

Full work available at URL: http://mathnet.ru/eng/pdm361

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

dynamic programmingtree decompositiongraph algorithms

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Dynamic programming (90C39) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

Unnamed Item

Cites Work

• Treewidth. Computations and approximations
• Memory requirements for table computations in partial \(k\)-tree algorithms
• Tree decompositions with small cost
• The monadic second-order logic of graphs III : tree-decompositions, minors and complexity issues
• Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: