A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth

Bodlaender, Hans L.

doi:10.1137/S0097539793251219

Record: found
Abstract: not found
Article: not found

A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth

Author(s): Hans L. Bodlaender

Publication date Created: December 1996

Publication date (Print): December 1996

Journal: SIAM Journal on Computing

Publisher: Society for Industrial & Applied Mathematics (SIAM)

Read this article at

ScienceOpenPublisher

There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

Related collections

Author and article information

Journal

Title: SIAM Journal on Computing

Abbreviated Title: SIAM J. Comput.

Publisher: Society for Industrial & Applied Mathematics (SIAM)

ISSN (Print): 0097-5397

ISSN (Electronic): 1095-7111

Publication date Created: December 1996

Publication date (Print): December 1996

Volume: 25

Issue: 6

Pages: 1305-1317

Article

DOI: 10.1137/S0097539793251219

SO-VID: 4332127d-72fd-4a5b-80c7-4c6a8d6dce32

History

Data availability:

A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth

Read this article at

Related collections

An Introduction to SAXS

Author and article information

Journal

Article

History

Comments

Comment on this article

Similar content 1,671

Cited by 250