The MapReduce-based approach to improve the shortest path computation in large-scale road networks: the case of A* algorithm.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/journals/jbd/AdoniNAE18
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/journals/jbd/AdoniNAE18
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Abdeltif_Elbyed
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Brahim_Aghezzaf
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Tarik_Nahhal
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Wilfried_Yves_Hamilton_Adoni
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1186%2Fs40537-018-0125-8
>
foaf:
homepage
<
https://doi.org/10.1186/s40537-018-0125-8
>
dc:
identifier
DBLP journals/jbd/AdoniNAE18
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1186%2Fs40537-018-0125-8
(xsd:string)
dcterms:
issued
2018
(xsd:gYear)
swrc:
journal
<
https://dblp.l3s.de/d2r/resource/journals/jbd
>
rdfs:
label
The MapReduce-based approach to improve the shortest path computation in large-scale road networks: the case of A* algorithm.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Abdeltif_Elbyed
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Brahim_Aghezzaf
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Tarik_Nahhal
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Wilfried_Yves_Hamilton_Adoni
>
swrc:
pages
16
(xsd:string)
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/journals/jbd/AdoniNAE18/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/journals/jbd/AdoniNAE18
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/journals/jbd/jbd5.html#AdoniNAE18
>
rdfs:
seeAlso
<
https://doi.org/10.1186/s40537-018-0125-8
>
dc:
title
The MapReduce-based approach to improve the shortest path computation in large-scale road networks: the case of A* algorithm.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:Article
rdf:
type
foaf:Document
swrc:
volume
5
(xsd:string)