Standard directed search strategies and their applications

DOI10.1007/s10878-007-9121-1zbMath1169.90474OpenAlexW1989900196MaRDI QIDQ1029267

Boting Yang, Yi Cao

Publication date: 10 July 2009

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-007-9121-1

zbMATH Keywords

digraphdirected searchpursuit-evasion problemoriented grids

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Cites Work

• Unnamed Item
• Digraph searching, directed vertex separation and directed pathwidth
• Some pursuit-evasion problems on grids
• Search and sweep numbers of finite directed acyclic graphs
• A pursuit-evasion problem on a grid
• Searching and pebbling
• Directed tree-width
• Lower bounds on the pathwidth of some grid-like graphs
• Directed path-width and monotonicity in digraph searching
• Lower Bounds on Edge Searching
• Topological Bandwidth
• The complexity of searching a graph
• Optimal Algorithms for a Pursuit-Evasion Problem in Grids
• SEARCHING A PSEUDO 3-SIDED SOLID ORTHOCONVEX GRID
• Mathematical Foundations of Computer Science 2005
• Algorithms and Computation

This page was built for publication: Standard directed search strategies and their applications