Helicopter search problems, bandwidth and pathwidth

DOI10.1016/S0166-218X(97)00131-5MaRDI QIDQ1392549zbMATH OpenOpenAlexFDO

Authors Fedor V. Fomin

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

zbMATH Keywords

computational complexitybandwidthsearch problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Searching and sorting (68P10)

Recommendations

• Note on a helicopter search problem on graphs
• SOFSEM 2006: Theory and Practice of Computer Science
• Aerial vehicle search-path optimization: a novel method for emergency operations
• On the coordinated search problem
• Technical Note—The Complexity of the Optimal Searcher Path Problem
• Path optimization for the resource-constrained searcher
• Routing problem for unmanned aerial vehicle patrolling missions -- a progressive hedging algorithm

Cites work

• scientific article; zbMATH DE number 4215756 (Why is no real title available?)
• scientific article; zbMATH DE number 4147519 (Why is no real title available?)
• scientific article; zbMATH DE number 4156240 (Why is no real title available?)
• scientific article; zbMATH DE number 3780976 (Why is no real title available?)
• scientific article; zbMATH DE number 176249 (Why is no real title available?)
• scientific article; zbMATH DE number 3590298 (Why is no real title available?)
• scientific article; zbMATH DE number 1151792 (Why is no real title available?)
• A Linear Algorithm for Topological Bandwidth in Degree-Three Trees
• A game of cops and robbers
• A partial k-arboretum of graphs with bounded treewidth
• Black-white pebbles and graph separation
• Complexity Results for Bandwidth Minimization
• Fugitive-search games on graphs and related parameters
• Graph minors. I. Excluding a forest
• Interval graphs and searching
• Narrowness, pathwidth, and their application in natural language processing
• On a pursuit game played on graphs for which a minor is excluded
• On the cop number of a graph
• One-dimensional logic gate assignment and interval graphs
• Optimal Algorithms for a Pursuit-Evasion Problem in Grids
• Recontamination does not help to search a graph
• Searching and pebbling
• Single step graph search problem
• Some pursuit-evasion problems on grids
• The bandwidth problem for graphs and matrices—a survey
• Topological Bandwidth

Cited in

(7)

• An annotated bibliography on guaranteed graph searching
• SOFSEM 2006: Theory and Practice of Computer Science
• Connections between cutting-pattern sequencing, VLSI design, and flexible machines
• On the domination search number
• Digraph searching, directed vertex separation and directed pathwidth
• The theory of guaranteed search on graphs
• The complexity of minimum-length path decompositions

This page was built for publication: Helicopter search problems, bandwidth and pathwidth

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1392549)