Strong-mixed searching and pathwidth

DOI10.1007/s10878-006-9013-9zbMath1112.90039OpenAlexW2059837177MaRDI QIDQ867027

Boting Yang

Publication date: 14 February 2007

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

Full work available at URL: https://doi.org/10.1007/s10878-006-9013-9

zbMATH Keywords

Cops-and-robber gameEdge searchMixed searchNode searchPursuit-evasion problem

Mathematics Subject Classification ID

Search theory (90B40) Differential games (aspects of game theory) (91A23)

Related Items (4)

Positive Semidefinite Zero Forcing: Complexity and Lower Bounds ⋮ An annotated bibliography on guaranteed graph searching ⋮ Lower bounds for positive semidefinite zero forcing and their applications ⋮ Zero-visibility cops and robber and the pathwidth of a graph

Cites Work

• Unnamed Item
• Mixed searching and proper-path-width
• Graph minors. I. Excluding a forest
• The vertex separation number of a graph equals its path-width
• Searching and pebbling
• The complexity of searching a graph
• Monotonicity in graph searching
• Recontamination does not help to search a graph
• Eavesdropping games

This page was built for publication: Strong-mixed searching and pathwidth