Average sensitivity of breadth-first search algorithms on grids

DOI10.1007/978-3-031-98740-3_13MaRDI QIDQ6876403zbMATH OpenFDO

Authors Ryan Assari, Qian-Ping Gu

Publication date 13 January 2026

Full work available at URL https://doi.org/10.1007/978-3-031-98740-3_13

zbMATH Keywords

breadth-first searchgraph algorithmsgrid graphsaverage sensitivity

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Discrete mathematics in relation to computer science (68Rxx)

Cites work

• scientific article; zbMATH DE number 7788381 (Why is no real title available?)
• A Stable Algorithm for Flat Radial Basis Functions on a Sphere
• Average sensitivity and noise sensitivity of polynomial threshold functions
• Average sensitivity of dynamic programming
• Average sensitivity of the knapsack problem
• Boolean functions with low average sensitivity depend on few coordinates
• Fast and numerically stable algorithms for discrete cosine transforms
• Stable Numerical Algorithms for Equilibrium Systems
• The average sensitivity of bounded-depth formulas

This page was built for publication: Average sensitivity of breadth-first search algorithms on grids

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