Time-dependent SHARC-routing (Q547279): Difference between revisions

@@ Property / DOI @@
-.1007/s00453-009-9341-0
@@ Property / DOI: 10.1007/s00453-009-9341-0 / rank @@
-Normal rank
@@ Property / author @@
-Daniel Delling
@@ Property / author: Daniel Delling / rank @@
-Normal rank
@@ Property / describes a project that uses @@
+R
@@ Property / describes a project that uses: R / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+Scotch
@@ Property / describes a project that uses: Scotch / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+DIMACS
@@ Property / describes a project that uses: DIMACS / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s00453-009-9341-0
+Normal rank
@@ Property / OpenAlex ID @@
+W4234928733
@@ Property / OpenAlex ID: W4234928733 / rank @@
+Normal rank
@@ Property / cites work @@
+SHARC
@@ Property / cites work: SHARC / rank @@
+Normal rank
@@ Property / cites work @@
+Q2847380
@@ Property / cites work: Q2847380 / rank @@
+Normal rank
@@ Property / cites work @@
+The shortest route through a network with time-dependent internodal transit times
+Normal rank
@@ Property / cites work @@
+Time-Dependent SHARC-Routing
@@ Property / cites work: Time-Dependent SHARC-Routing / rank @@
+Normal rank
@@ Property / cites work @@
+Bidirectional Core-Based Routing in Dynamic Time-Dependent Road Networks
+Normal rank
@@ Property / cites work @@
+Engineering Route Planning Algorithms
@@ Property / cites work: Engineering Route Planning Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Q3574265
@@ Property / cites work: Q3574265 / rank @@
+Normal rank
@@ Property / cites work @@
+A note on two problems in connexion with graphs
@@ Property / cites work: A note on two problems in connexion with graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q2921666
@@ Property / cites work: Q2921666 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3574261
@@ Property / cites work: Q3574261 / rank @@
+Normal rank
@@ Property / cites work @@
+Experimental and Efficient Algorithms
@@ Property / cites work: Experimental and Efficient Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Q3574259
@@ Property / cites work: Q3574259 / rank @@
+Normal rank
@@ Property / cites work @@
+Experimental and Efficient Algorithms
@@ Property / cites work: Experimental and Efficient Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Partitioning graphs to speedup Dijkstra's algorithm
+Normal rank
@@ Property / cites work @@
+Bidirectional A  ∗  Search for Time-Dependent Fast Paths
+Normal rank
@@ Property / cites work @@
+Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length
+Normal rank
@@ Property / cites work @@
+Q2847388
@@ Property / cites work: Q2847388 / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient models for timetable information in public transportation systems
+Normal rank
@@ Property / cites work @@
+Algorithms – ESA 2005
@@ Property / cites work: Algorithms – ESA 2005 / rank @@
+Normal rank
@@ Property / cites work @@
+Engineering Highway Hierarchies
@@ Property / cites work: Engineering Highway Hierarchies / rank @@
+Normal rank
@@ Property / DOI @@
+.1007/S00453-009-9341-0
@@ Property / DOI: 10.1007/S00453-009-9341-0 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:547279