A new approach to dynamic all pairs shortest paths.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/journals/jacm/DemetrescuI04
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/journals/jacm/DemetrescuI04
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Camil_Demetrescu
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Giuseppe_F._Italiano
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1145%2F1039488.1039492
>
foaf:
homepage
<
https://doi.org/10.1145/1039488.1039492
>
dc:
identifier
DBLP journals/jacm/DemetrescuI04
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1145%2F1039488.1039492
(xsd:string)
dcterms:
issued
2004
(xsd:gYear)
swrc:
journal
<
https://dblp.l3s.de/d2r/resource/journals/jacm
>
rdfs:
label
A new approach to dynamic all pairs shortest paths.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Camil_Demetrescu
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Giuseppe_F._Italiano
>
swrc:
number
6
(xsd:string)
swrc:
pages
968-992
(xsd:string)
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/journals/jacm/DemetrescuI04/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/journals/jacm/DemetrescuI04
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/journals/jacm/jacm51.html#DemetrescuI04
>
rdfs:
seeAlso
<
https://doi.org/10.1145/1039488.1039492
>
dc:
subject
Dynamic graph algorithms, shortest paths
(xsd:string)
dc:
title
A new approach to dynamic all pairs shortest paths.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:Article
rdf:
type
foaf:Document
swrc:
volume
51
(xsd:string)