Fugitive-search games on graphs and related parameters

DOI10.1007/3-540-59071-4_59zbMath1530.05126MaRDI QIDQ6184381

Dimitrios M. Thilikos, Nick D. Dendris, Lefteris M. Kirousis

Publication date: 5 January 2024

Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

zbMATH Keywords

treewidthsearch strategiesfugitive's speed

Mathematics Subject Classification ID

Games involving graphs (91A43) Paths and cycles (05C38) Distance in graphs (05C12) Positional games (pursuit and evasion, etc.) (91A24) Games on graphs (graph-theoretic aspects) (05C57)

Cites Work

• Graph minors. III. Planar tree-width
• Interval graphs and searching
• Efficient algorithms for combinatorial problems on graphs with bounded decomposability - a survey
• Tree clustering for constraint networks
• The vertex separation number of a graph equals its path-width
• Graph searching and a min-max theorem for tree-width
• The vertex separation and search number of a graph
• Searching and pebbling
• The intersection graphs of subtrees in trees are exactly the chordal graphs
• A sufficient condition for backtrack-bounded search
• The complexity of searching a graph
• A Sufficient Condition for Backtrack-Free Search
• Monotonicity in graph searching
• The Pathwidth and Treewidth of Cographs
• The Linkage of a Graph
• Recontamination does not help to search a graph
• Eavesdropping games
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Fugitive-search games on graphs and related parameters