On the Fast Searching Problem

DOI10.1007/978-3-540-68880-8_15MaRDI QIDQ3511423zbMATH OpenOpenAlexFDO

Authors Danny Dyer, Boting Yang, O. Yaşar

Publication date 10 July 2008

Published in Algorithmic Aspects in Information and Management (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-68880-8_15

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• Three-fast-searchable graphs
• Fast edge searching and fast searching on graphs
• Fast searching games on graphs
• Fast edge-searching and related problems
• Lower bounds on fast searching

Cited in

(32)

• Edge and node searching problems on trees
• The fast search number of a complete \(k\)-partite graph
• Four-searchable biconnected outerplanar graphs
• Positive semidefinite zero forcing numbers of two classes of graphs
• Distributed graph searching with a sense of direction
• Minimum rank and zero forcing number for butterfly networks
• Three-fast-searchable graphs
• Fast searching on cactus graphs
• The complexity of the positive semidefinite zero forcing
• Fast searching on complete k-partite graphs
• Fast searching on Cartesian products of graphs
• Fast edge-searching and related problems
• Fast-mixed searching on graphs
• Positive semidefinite zero forcing: complexity and lower bounds
• scientific article; zbMATH DE number 5540281 (Why is no real title available?)
• Lower bounds on fast searching
• On the weak prefix-search problem
• On minimum cost edge searching
• Fast-mixed searching and related problems on graphs
• Fast searching games on graphs
• scientific article; zbMATH DE number 1738544 (Why is no real title available?)
• On the Cooperative Graph Searching Problem
• Lower bounds for positive semidefinite zero forcing and their applications
• scientific article; zbMATH DE number 7271257 (Why is no real title available?)
• The fast search number of a Cartesian product of graphs
• On the complexity of the positive semidefinite zero forcing number
• Fast searching on k-combinable graphs
• Edge searching and fast searching with constraints
• Fast edge searching and fast searching on graphs
• Constrained graph searching on trees
• Quest for fast partial search algorithm
• Minimum dominating set of queens: a trivial programming exercise?

This page was built for publication: On the Fast Searching Problem

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