Fast searching on cactus graphs

DOI10.1007/S10878-023-01012-XMaRDI QIDQ2696935zbMATH OpenOpenAlexFDO

Authors Yuan Xue, Boting Yang, Sandra Zilles, Lusheng Wang

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)

Cites work

• An annotated bibliography on guaranteed graph searching
• Fast edge searching and fast searching on graphs
• Fast searching games on 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?)
• scientific article; zbMATH DE number 1151792 (Why is no real title available?)
• scientific article; zbMATH DE number 5241699 (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 pebbling
• 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
• Three-fast-searchable graphs
• Topological Bandwidth

Cited in

(5)

• Optimal Data Structures for Farthest-Point Queries in Cactus Networks
• Fast-mixed searching and related problems on graphs
• Edge searching and fast searching with constraints
• On the sizes of generalized cactus graphs
• Constrained graph searching on trees

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

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