Lower Bounds on Edge Searching
From MaRDI portal
Publication:3611939
DOI10.1007/978-3-540-74450-4_46zbMath1176.91017MaRDI QIDQ3611939
Danny Dyer, Denis Hanson, Boting Yang, Brian Alspach
Publication date: 3 March 2009
Published in: Combinatorics, Algorithms, Probabilistic and Experimental Methodologies (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-74450-4_46
05C90: Applications of graph theory
91A43: Games involving graphs
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
Related Items
Edge Search Number of Cographs in Linear Time, Edge search number of cographs, Fast edge searching and fast searching on graphs, An annotated bibliography on guaranteed graph searching, Standard directed search strategies and their applications, The fast search number of a complete \(k\)-partite graph, Fast Searching on Complete k-partite Graphs