Theoretical Computer Science
The complexity of searching a graph
Journal of the ACM (JACM)
Graph minors: X. obstructions to tree-decomposition
Journal of Combinatorial Theory Series B
The vertex separation number of a graph equals its path-width
Information Processing Letters
Recontamination does not help to search a graph
Journal of the ACM (JACM)
On the pathwidth of chordal graphs
Discrete Applied Mathematics - ARIDAM IV and V
Approximating treewidth, pathwidth, frontsize, and shortest elimination tree
Journal of Algorithms
The vertex separation and search number of a graph
Information and Computation
Treewidth and Pathwidth of Permutation Graphs
SIAM Journal on Discrete Mathematics
Efficient and constructive algorithms for the pathwidth and treewidth of graphs
Journal of Algorithms
A partial k-arboretum of graphs with bounded treewidth
Theoretical Computer Science
Capture of an intruder by mobile agents
Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures
Approximation of pathwidth of outerplanar graphs
Journal of Algorithms
Computing Treewidth and Minimum Fill-In: All You Need are the Minimal Separators
ESA '93 Proceedings of the First Annual European Symposium on Algorithms
Computing the vertex separation of unicyclic graphs
Information and Computation
Improved approximation algorithms for minimum-weight vertex separators
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
A 3-approximation for the pathwidth of Halin graphs
Journal of Discrete Algorithms
Node-searching problem on block graphs
Discrete Applied Mathematics
An annotated bibliography on guaranteed graph searching
Theoretical Computer Science
Connected graph searching in chordal graphs
Discrete Applied Mathematics
Pathwidth is NP-Hard for Weighted Trees
FAW '09 Proceedings of the 3d International Workshop on Frontiers in Algorithmics
Pathwidth of circular-arc graphs
WG'07 Proceedings of the 33rd international conference on Graph-theoretic concepts in computer science
Connected searching of weighted trees
Theoretical Computer Science
Information and Computation
Width Parameters Beyond Tree-width and their Applications
The Computer Journal
| Hi-index | 5.23 |
The problems of (classical) searching and connected searching of weighted trees are known to be computationally hard. In this work we give a polynomial-time 3-approximation algorithm that finds a connected search strategy of a given weighted tree. This in particular yields constant factor approximation algorithms for the (non-connected) classical searching problems and for the weighted pathwidth problem for this class of graphs.