Edge and node searching problems on trees
From MaRDI portal
Publication:1575444
DOI10.1016/S0304-3975(99)00241-8zbMath0945.68143OpenAlexW2053664185MaRDI QIDQ1575444
Publication date: 21 August 2000
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0304-3975(99)00241-8
Related Items
Edge Search Number of Cographs in Linear Time ⋮ Pathwidth is NP-Hard for Weighted Trees ⋮ Mixed Search Number of Permutation Graphs ⋮ Edge search number of cographs ⋮ A distributed algorithm for computing the node search number in trees ⋮ An annotated bibliography on guaranteed graph searching ⋮ Exclusive graph searching ⋮ Edge and node searching problems on trees
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On minimizing width in linear layouts
- Graph minors. I. Excluding a forest
- Interval graphs and searching
- Min Cut is NP-complete for edge weighted trees
- Narrowness, pathwidth, and their application in natural language processing
- The vertex separation number of a graph equals its path-width
- On the pathwidth of chordal graphs
- The vertex separation and search number of a graph
- Treewidth. Computations and approximations
- Edge and node searching problems on trees
- Searching and pebbling
- Topological Bandwidth
- Polynomial Time Algorithms for the MIN CUT Problem on Degree Restricted Trees
- Complexity of Finding Embeddings in a k-Tree
- A polynomial algorithm for the min-cut linear arrangement of trees
- The complexity of searching a graph
- Monotonicity in graph searching
- The Pathwidth and Treewidth of Cographs
- Treewidth and Pathwidth of Permutation Graphs
- Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs
- Recontamination does not help to search a graph
