Lower Bounds on Fast Searching

DOI10.1007/978-3-642-10631-6_97zbMath1273.68153OpenAlexW1595525475MaRDI QIDQ3652283

Donald Stanley, Boting Yang

Publication date: 17 December 2009

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-10631-6_97

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

Fast edge searching and fast searching on graphs