Swapping a Failing Edge of a Single Source Shortest Paths Tree Is Good and Fast.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/journals/algorithmica/NardelliPW03
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/journals/algorithmica/NardelliPW03
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Enrico_Nardelli
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Guido_Proietti
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Peter_Widmayer
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1007%2Fs00453-002-0988-z
>
foaf:
homepage
<
https://doi.org/10.1007/s00453-002-0988-z
>
dc:
identifier
DBLP journals/algorithmica/NardelliPW03
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1007%2Fs00453-002-0988-z
(xsd:string)
dcterms:
issued
2003
(xsd:gYear)
swrc:
journal
<
https://dblp.l3s.de/d2r/resource/journals/algorithmica
>
rdfs:
label
Swapping a Failing Edge of a Single Source Shortest Paths Tree Is Good and Fast.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Enrico_Nardelli
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Guido_Proietti
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Peter_Widmayer
>
swrc:
number
1
(xsd:string)
swrc:
pages
56-74
(xsd:string)
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/journals/algorithmica/NardelliPW03/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/journals/algorithmica/NardelliPW03
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/journals/algorithmica/algorithmica35.html#NardelliPW03
>
rdfs:
seeAlso
<
https://doi.org/10.1007/s00453-002-0988-z
>
dc:
title
Swapping a Failing Edge of a Single Source Shortest Paths Tree Is Good and Fast.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:Article
rdf:
type
foaf:Document
swrc:
volume
35
(xsd:string)