A linear time algorithm for finding tree-decompositions of small treewidth

A linear time algorithm for finding tree-decompositions of small treewidth A linear time algorithm tree-decompositions for finding of small treewidth* Hans L. Bodlaendert Abstract In this paper, we give, for constant k, a linear time algorithm, that given a graph G = (V, E), the treewidth determines whether of G is at most k, and if so, finds a tree- far, this step dominated the running time of most algo- rithms, as the second step (some kind of ˜dynamic programming ™ algorithm using the tree-decomposition) usually costs only linear time. The best algorithm known so far for thk ˜first step ™ was an algorithm by Reed [21], which costs O(n log n). In this paper, we improve on this result, and give a linear time algorithm. The problem ˜Given a graph G = (V, E) and an integer k, decomposition of G with treewidth at most k. A consequence is that every minor-closed class of graphs that does not contain all planar graphs has a linear time recognition algorithm. Keywords: graph algorhhms, treewidth, pathwidth, partial Mrees, graph minors. is the treewidth of G at most k ˜ is NP-complete [3]. Much work has been done on this problem for constant k. For k = 1,2,3, linear time algorithms http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png

A linear time algorithm for finding tree-decompositions of small treewidth

Association for Computing Machinery — Jun 1, 1993

Loading next page...
 
/lp/association-for-computing-machinery/a-linear-time-algorithm-for-finding-tree-decompositions-of-small-omyz55ciN7
Datasource
Association for Computing Machinery
Copyright
Copyright © 1993 by ACM Inc.
ISBN
0-89791-591-7
D.O.I.
10.1145/167088.167161
Publisher site
See Article on Publisher Site

Abstract

A linear time algorithm tree-decompositions for finding of small treewidth* Hans L. Bodlaendert Abstract In this paper, we give, for constant k, a linear time algorithm, that given a graph G = (V, E), the treewidth determines whether of G is at most k, and if so, finds a tree- far, this step dominated the running time of most algo- rithms, as the second step (some kind of ˜dynamic programming ™ algorithm using the tree-decomposition) usually costs only linear time. The best algorithm known so far for thk ˜first step ™ was an algorithm by Reed [21], which costs O(n log n). In this paper, we improve on this result, and give a linear time algorithm. The problem ˜Given a graph G = (V, E) and an integer k, decomposition of G with treewidth at most k. A consequence is that every minor-closed class of graphs that does not contain all planar graphs has a linear time recognition algorithm. Keywords: graph algorhhms, treewidth, pathwidth, partial Mrees, graph minors. is the treewidth of G at most k ˜ is NP-complete [3]. Much work has been done on this problem for constant k. For k = 1,2,3, linear time algorithms

There are no references for this article.

You’re reading a free preview. Subscribe to read the entire article.


DeepDyve is your
personal research library

It’s your single place to instantly
discover and read the research
that matters to you.

Enjoy affordable access to
over 18 million articles from more than
15,000 peer-reviewed journals.

All for just $49/month

Explore the DeepDyve Library

Search

Query the DeepDyve database, plus search all of PubMed and Google Scholar seamlessly

Organize

Save any article or search result from DeepDyve, PubMed, and Google Scholar... all in one place.

Access

Get unlimited, online access to over 18 million full-text articles from more than 15,000 scientific journals.

Your journals are on DeepDyve

Read from thousands of the leading scholarly journals from SpringerNature, Elsevier, Wiley-Blackwell, Oxford University Press and more.

All the latest content is available, no embargo periods.

See the journals in your area

DeepDyve

Freelancer

DeepDyve

Pro

Price

FREE

$49/month
$360/year

Save searches from
Google Scholar,
PubMed

Create lists to
organize your research

Export lists, citations

Read DeepDyve articles

Abstract access only

Unlimited access to over
18 million full-text articles

Print

20 pages / month

PDF Discount

20% off