Results 281 to 290 of about 1,848,326 (324)
Some of the next articles are maybe not open access.
Proceedings 35th Annual Symposium on Foundations of Computer Science, 1994
D. Eppstein
semanticscholar +1 more source
D. Eppstein
semanticscholar +1 more source
Deterministic Partially Dynamic Single Source Shortest Paths for Sparse Graphs
ACM-SIAM Symposium on Discrete Algorithms, 2017A. Bernstein, S. Chechik
semanticscholar +1 more source
The shortest path tree problem is a classical and widely studied combinatorial problem. The scope of this article is to provide an extensive treatment of the major classical approaches. It then proceeds focusing on the auction algorithm and some of its recently developed variants.
openaire +2 more sources
openaire +2 more sources
1986
Recently there has been considerable research activity on algorithms for finding shortest paths in geometries induced by obstacles. A typical problem is finding the shortest path between two points on the Euclidean plane avoiding a given set of polygonal obstacles (see Figure 1). We review this area and isolate several interesting open problems.
openaire +1 more source
Recently there has been considerable research activity on algorithms for finding shortest paths in geometries induced by obstacles. A typical problem is finding the shortest path between two points on the Euclidean plane avoiding a given set of polygonal obstacles (see Figure 1). We review this area and isolate several interesting open problems.
openaire +1 more source
Maintaining Shortest Paths Under Deletions in Weighted Directed Graphs
SIAM journal on computing (Print), 2016A. Bernstein
semanticscholar +1 more source
Two-dimensional diamonds from sp2-to-sp3 phase transitions
Nature Reviews Materials, 2022Francesco Lavini +2 more
exaly
Deterministic decremental single source shortest paths: beyond the o(mn) bound
Symposium on the Theory of Computing, 2016A. Bernstein, S. Chechik
semanticscholar +1 more source