Showing 2025Show all
2 papers · 1 filter
quant-ph2025
Robust Treasure Hunt in Anonymous Graphs with Quantum Pebbles by Oblivious Agents
Gaurav Gaur, Barun Gorain, Rishi Ranjan Singh +1
We study how to find a hidden treasure in anonymous graphs using an agent that has no persistent memory. The nodes are indistinguishable, and only edges have local port numbers. Cl…
math.CO2025
On the stress transit function
Arun Anil, Manoj Changat, Tanja Dravec +5
The stress interval between is the set of all vertices in a graph that lie on every shortest -path. A set is stress convex if $S(…