25 citations · 119 across the 29 of their papers we have counts for
Showing 2010Show all
2 papers · 1 filter
cs.DM2010★ 19 cited
From Pathwidth to Connected Pathwidth
Dariusz Dereniowski
It is proven that the connected pathwidth of any graph is at most $2\cdot\pw(G)+1$, where $\pw(G)$ is the pathwidth of . The method is constructive, i.e. it yields an effici…
cs.DS2010★ 22 cited
Connected searching of weighted trees
Dariusz Dereniowski
In this paper we consider the problem of connected edge searching of weighted trees. It is shown that there exists a polynomial-time algorithm for finding optimal connected search…