Instance-optimality of bidirectional Dijkstra on simple weighted graphs
Statement
Let be a simple graph, directed or undirected, with positive real-valued edge weights, and let . When the graph is accessed through vertex and incident-edge queries, is bidirectional Dijkstra instance-optimal for computing the shortest-path distance , both in the order-oblivious model, where incident edges are presented in a random order, and in the order-dependent model, where their order is fixed and accessible to the algorithm?
Record
- Added
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.