Constrained graph searching on trees

DOI10.1007/978-3-031-39344-0_18MaRDI QIDQ6535820zbMATH OpenFDO

Authors Lusheng Wang, Boting Yang, Zhaohui Zhan

Publication date 28 February 2024

Full work available at URL https://doi.org/10.1007/978-3-031-39344-0_18

zbMATH Keywords

edge search numberfast search numbergraph searchingtree

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Games involving graphs (91A43)

Recommendations

• On the Fast Searching Problem
• Fast edge searching and fast searching on graphs
• Fast edge-searching and related problems
• Edge and node searching problems on trees
• Fast searching games on graphs

Cites work

• An annotated bibliography on guaranteed graph searching
• Fast edge searching and fast searching on graphs
• Fast searching games on graphs
• Fast searching on cactus graphs
• scientific article; zbMATH DE number 176249 (Why is no real title available?)
• scientific article; zbMATH DE number 3590298 (Why is no real title available?)
• Monotonicity in graph searching
• On the Fast Searching Problem
• Recontamination does not help to search a graph
• Searching and sweeping graphs: a brief survey
• The complexity of searching a graph
• The fast search number of a Cartesian product of graphs
• The fast search number of a complete \(k\)-partite graph
• The game of cops and robbers on graphs
• The vertex separation and search number of a graph
• The vertex separation number of a graph equals its path-width
• Three-fast-searchable graphs
• Topological Bandwidth

This page was built for publication: Constrained graph searching on trees

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