On the Fast Searching Problem
From MaRDI portal
Publication:3511423
DOI10.1007/978-3-540-68880-8_15zbMath1143.68587OpenAlexW1600238706MaRDI QIDQ3511423
Öznur Yaşar, Boting Yang, Danny Dyer
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
Graph theory (including graph drawing) in computer science (68R10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (20)
Positive Semidefinite Zero Forcing: Complexity and Lower Bounds ⋮ On the Cooperative Graph Searching Problem ⋮ The Complexity of the Positive Semidefinite Zero Forcing ⋮ Fast-mixed searching and related problems on graphs ⋮ Fast searching on \(k\)-combinable graphs ⋮ Edge searching and fast searching with constraints ⋮ Fast Searching on Complete k-partite Graphs ⋮ Minimum rank and zero forcing number for butterfly networks ⋮ Fast edge searching and fast searching on graphs ⋮ Fast searching on cactus graphs ⋮ Three-fast-searchable graphs ⋮ Fast Searching on Cartesian Products of Graphs ⋮ Four-searchable biconnected outerplanar graphs ⋮ Lower bounds for positive semidefinite zero forcing and their applications ⋮ The fast search number of a Cartesian product of graphs ⋮ Minimum dominating set of queens: a trivial programming exercise? ⋮ On the complexity of the positive semidefinite zero forcing number ⋮ The fast search number of a complete \(k\)-partite graph ⋮ Searching by heterogeneous agents ⋮ Positive semidefinite zero forcing numbers of two classes of graphs
This page was built for publication: On the Fast Searching Problem