ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let G=(V,E)G=(V,E) be a simple graph, directed or undirected, with positive real-valued edge weights, and let s,t∈Vs,t\in V. When the graph is accessed through vertex and incident-edge queries, is bidirectional Dijkstra instance-optimal for computing the shortest-path distance dist⁡G(s,t)\operatorname{dist}_G(s,t), 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
Links

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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.