Edge searching and fast searching with constraints

DOI10.1016/j.tcs.2024.114416OpenAlexW4391247836WikidataQ129290861 ScholiaQ129290861MaRDI QIDQ6122599

Lusheng Wang, Boting Yang

Publication date: 1 March 2024

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2024.114416

zbMATH Keywords

treegraphfast searchingedge searching

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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 vertex separation number of a graph equals its path-width
• The vertex separation and search number of a graph
• The fast search number of a complete \(k\)-partite graph
• Three-fast-searchable graphs
• Fast searching on cactus graphs
• On the Fast Searching Problem
• On the Cutwidth and the Topological Bandwidth of a Tree
• Topological Bandwidth
• The complexity of searching a graph
• Monotonicity in graph searching
• Handbook of Combinatorial Optimization
• Recontamination does not help to search a graph

This page was built for publication: Edge searching and fast searching with constraints