A simple linear-time algorithm for finding path-decompositions of small width

Details A simple linear-time algorithm for finding path-decompositions of small width A simple linear-time algorithm for finding path-decompositions of small width

1994-10-26

arxiv.org/abs/math/9410211v1

Mathematics

Combinatorics

9 pages

Scientific paper

We described a simple algorithm running in linear time for each fixed
constant $k$, that either establishes that the pathwidth of a graph $G$ is
greater than $k$, or finds a path-decomposition of $G$ of width at most
$O(2^{k})$. This provides a simple proof of the result by Bodlaender that many
families of graphs of bounded pathwidth can be recognized in linear time.

Affiliated with

Also associated with

No associations

Rating

A simple linear-time algorithm for finding path-decompositions of small width does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A simple linear-time algorithm for finding path-decompositions of small width, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A simple linear-time algorithm for finding path-decompositions of small width will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-314674