ScholarLens Back to search
1988•Lecture notes in computer scienceOpen access

Dynamic programming on graphs with bounded treewidth

Hans L. Bodlaender

Open full text 316 citations

Abstract

This record does not include an abstract. Use the full-text link above if available.

Open-access reader

About this research paper

What this paper is about

An abstract is not available in the OpenAlex record for this paper.

Why it matters

OpenAlex reports 316 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Key concepts: Treewidth, Partial k-tree, Combinatorics, Tree-depth, Tree decomposition, Mathematics, Discrete mathematics, Bounded function

Related papers

Related paper 1Related paper 2
Back to paper searchBrowse research topicsOriginal source
Dynamic programming on graphs with bounded treewidth — Research Paper | ScholarLens