Остановите войну!
for scientists:
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 15 matches
- 2009
- Camil Demetrescu, Andrew V. Goldberg, David S. Johnson:
The Shortest Path Problem, Proceedings of a DIMACS Workshop, Piscataway, New Jersey, USA, November 13-14, 2006. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 74, DIMACS/AMS 2009, ISBN 978-0-8218-4383-3 [contents] - 2006
- Deepak Ajwani, Ulrich Meyer, Vitaly Osipov:
Breadth First Search on Massive Graphs. The Shortest Path Problem 2006: 291-307 - Christopher L. Barrett, Keith R. Bisset, Martin Holzer, Goran Konjevod, Madhav V. Marathe, Dorothea Wagner:
Engineering Label-Constrained Shortest-Path Algorithms. The Shortest Path Problem 2006: 309-319 - Hannah Bast, Stefan Funke, Domagoj Matijevic:
Ultrafast Shortest-Path Queries via Transit Nodes. The Shortest Path Problem 2006: 175-192 - Daniel Delling, Martin Holzer, Kirill Müller, Frank Schulz, Dorothea Wagner:
High-Performance Multi-Level Routing. The Shortest Path Problem 2006: 73-91 - Daniel Delling, Peter Sanders, Dominik Schultes, Dorothea Wagner:
Highway Hierarchies Star. The Shortest Path Problem 2006: 141-174 - Nick Edmonds, Alex Breuer, Douglas P. Gregor, Andrew Lumsdaine:
Single-Source Shortest Paths with the Parallel Boost Graph Library. The Shortest Path Problem 2006: 219-248 - Andrew V. Goldberg, Haim Kaplan, Renato F. Werneck:
Reach for A*: Shortest Path Algorithms with Preprocessing. The Shortest Path Problem 2006: 93-139 - Moritz Hilger, Ekkehard Köhler, Rolf H. Möhring, Heiko Schilling:
Fast Point-to-Point Shortest Path Computations with Arc-Flags. The Shortest Path Problem 2006: 41-72 - Ulrich Lauther:
An Experimental Evaluation of Point-To-Point Shortest Path Calculation on Road Networks with Precalculated Edge-Flags. The Shortest Path Problem 2006: 19-39 - Kamesh Madduri, David A. Bader, Jonathan W. Berry, Joseph R. Crobak:
Parallel Shortest Path Algorithms for Solving Large-Scale Instances. The Shortest Path Problem 2006: 249-290 - Peter Sanders, Dominik Schultes:
Robust, Almost Constant Time Shortest-Path Queries in Road Networks. The Shortest Path Problem 2006: 193-218 - Jose L. Santos:
Real-World Applications of Shortest Path Algorithms. The Shortest Path Problem 2006: 1-17 - Foreword. The Shortest Path Problem 2006: vii-
- Introduction. The Shortest Path Problem 2006: ix-
loading more results
failed to load more results, please try again later
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-05-28 13:30 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint