From Pathwidth to Connected Pathwidth

Details From Pathwidth to Connected Pathwidth From Pathwidth to Connected Pathwidth

2010-07-08

arxiv.org/abs/1007.1269v2

Computer Science

Discrete Mathematics

Scientific paper

It is proven that the connected pathwidth of any graph $G$ is at most $2\cdot\pw(G)+1$, where $\pw(G)$ is the pathwidth of $G$. The method is constructive, i.e. it yields an efficient algorithm that for a given path decomposition of width $k$ computes a connected path decomposition of width at most $2k+1$. The running time of the algorithm is $O(dk^2)$, where $d$ is the number of `bags' in the input path decomposition. The motivation for studying connected path decompositions comes from the connection between the pathwidth and the search number of a graph. One of the advantages of the above bound for connected pathwidth is an inequality $\csn(G)\leq 2\sn(G)+3$, where $\csn(G)$ and $\sn(G)$ are the connected search number and the search number of $G$. Moreover, the algorithm presented in this work can be used to convert a given search strategy using $k$ searchers into a (monotone) connected one using $2k+3$ searchers and starting at an arbitrary homebase.

Affiliated with

Also associated with

No associations

Rating

From Pathwidth to Connected Pathwidth 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 From Pathwidth to Connected Pathwidth, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and From Pathwidth to Connected Pathwidth will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-102102