3 papers
cs.DS2026
Average Case Graph Searching in Non-Uniform Cost Models
Michał Szyfelbein
We consider the following generalization of the classic Binary Search Problem: a searcher is required to find a hidden target vertex in a graph , by iteratively performing q…
cs.DS2025
Approximating the Average-Case Graph Search Problem with Non-Uniform Costs
Michał Szyfelbein
Consider the following generalization of the classic binary search problem: A searcher is required to find a hidden target vertex in a graph . To do so, they iteratively per…
cs.DS2025
Searching in trees with -up-modular cost functions
Michał Szyfelbein
Consider the following generalization of the classic binary search problem: a searcher is required to find a hidden vertex in a tree . To do so, they iteratively perform que…