Reduction Algorithms for Graphs of Small Treewidth - researchr publication related

researchr

You are not signed in
Sign in
Sign up

Hans Leo Bodlaender, Babette van Antwerpen-de Fluiter. Reduction Algorithms for Graphs of Small Treewidth. Inf. Comput., 167(2):86-119, 2001.

The following publications are possibly variants of this publication:

On Reduction Algorithms for Graphs with Small TreewidthHans L. Bodlaender. criwg 1994: 45-56

Reduction Algorithms for Constructing Solutions in Graphs with Small TreewidthHans Leo Bodlaender, Babette de Fluiter. cocoon 1996: 199-208

NC-Algorithms for Graphs with Small TreewidthHans Leo Bodlaender. criwg 1989: 1-10

Improved Self-Reduction Algorithms for Graphs with Bounded TreewidthHans Leo Bodlaender. criwg 1990: 232-244

Improved Self-reduction Algorithms for Graphs with Bounded TreewidthHans Leo Bodlaender. DAM, 54(2-3):101-115, 1994. [doi]

Treewidth for Graphs with Small ChordalityHans L. Bodlaender, Dimitrios M. Thilikos. DAM, 79(1-3):45-61, 1997. [doi]

A Polynomial Time Algorithm for the Cutwidth of Bounded Degree Graphs with Small TreewidthDimitrios M. Thilikos, Maria J. Serna, Hans Leo Bodlaender. esa 2001: 380-390 [doi]

runs on WebDSL