Helicopter search problems, bandwidth and pathwidth
From MaRDI portal
Publication:1392549
DOI10.1016/S0166-218X(97)00131-5zbMath0901.68042OpenAlexW2029460394MaRDI QIDQ1392549
Publication date: 28 July 1998
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: http://www.elsevier.com/locate/dam
Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Graph theory (including graph drawing) in computer science (68R10)
Related Items (6)
Connections between cutting-pattern sequencing, VLSI design, and flexible machines ⋮ The theory of guaranteed search on graphs ⋮ An annotated bibliography on guaranteed graph searching ⋮ The complexity of minimum-length path decompositions ⋮ Digraph searching, directed vertex separation and directed pathwidth ⋮ On the domination search number
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A game of cops and robbers
- Graph minors. I. Excluding a forest
- Interval graphs and searching
- On a pursuit game played on graphs for which a minor is excluded
- Black-white pebbles and graph separation
- Single step graph search problem
- Narrowness, pathwidth, and their application in natural language processing
- Some pursuit-evasion problems on grids
- A partial k-arboretum of graphs with bounded treewidth
- On the cop number of a graph
- Fugitive-search games on graphs and related parameters
- Searching and pebbling
- One-dimensional logic gate assignment and interval graphs
- Topological Bandwidth
- A Linear Algorithm for Topological Bandwidth in Degree-Three Trees
- Optimal Algorithms for a Pursuit-Evasion Problem in Grids
- The bandwidth problem for graphs and matrices—a survey
- Complexity Results for Bandwidth Minimization
- Recontamination does not help to search a graph
This page was built for publication: Helicopter search problems, bandwidth and pathwidth
