Fast searching on cactus graphs

DOI10.1007/s10878-023-01012-xOpenAlexW4360975061MaRDI QIDQ2696935

Yuan Xue, Boting Yang, Lusheng Wang, Sandra Zilles

Publication date: 17 April 2023

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

Full work available at URL: https://doi.org/10.1007/s10878-023-01012-x

Mathematics Subject Classification ID

Mathematical programming (90Cxx)

Related Items (2)

Edge searching and fast searching with constraints ⋮ On the sizes of generalized cactus graphs

Cites Work

• Fast searching games on graphs
• The fast search number of a Cartesian product of graphs
• Fast edge searching and fast searching on graphs
• An annotated bibliography on guaranteed graph searching
• The fast search number of a complete \(k\)-partite graph
• Searching and pebbling
• Three-fast-searchable graphs
• On the Fast Searching Problem
• Topological Bandwidth
• The complexity of searching a graph
• Monotonicity in graph searching
• Recontamination does not help to search a graph
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Fast searching on cactus graphs