The one-to-one shortest-path problem: An empirical analysis with the two-tree Dijkstra algorithm.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/journals/coap/HelgasonKS93
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/journals/coap/HelgasonKS93
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/B._Douglas_Stewart
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Jeffery_L._Kennington
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Richard_V._Helgason
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1007%2FBF01299142
>
foaf:
homepage
<
https://doi.org/10.1007/BF01299142
>
dc:
identifier
DBLP journals/coap/HelgasonKS93
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1007%2FBF01299142
(xsd:string)
dcterms:
issued
1993
(xsd:gYear)
swrc:
journal
<
https://dblp.l3s.de/d2r/resource/journals/coap
>
rdfs:
label
The one-to-one shortest-path problem: An empirical analysis with the two-tree Dijkstra algorithm.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/B._Douglas_Stewart
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Jeffery_L._Kennington
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Richard_V._Helgason
>
swrc:
number
1
(xsd:string)
swrc:
pages
47-75
(xsd:string)
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/journals/coap/HelgasonKS93/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/journals/coap/HelgasonKS93
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/journals/coap/coap2.html#HelgasonKS93
>
rdfs:
seeAlso
<
https://doi.org/10.1007/BF01299142
>
dc:
title
The one-to-one shortest-path problem: An empirical analysis with the two-tree Dijkstra algorithm.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:Article
rdf:
type
foaf:Document
swrc:
volume
2
(xsd:string)