A new approach to dynamic all pairs shortest paths. | D2R Server publishing the DBLP Bibliography Database, hosted at L3S Research Center

Property	Value
dcterms:bibliographicCitation	<http://dblp.uni-trier.de/rec/bibtex/conf/stoc/DemetrescuI03>
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%2F780542.780567>
foaf:homepage	<https://doi.org/10.1145/780542.780567>
dc:identifier	DBLP conf/stoc/DemetrescuI03 (xsd:string)
dc:identifier	DOI doi.org%2F10.1145%2F780542.780567 (xsd:string)
dcterms:issued	2003 (xsd:gYear)
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:pages	159-166 (xsd:string)
dcterms:partOf	<https://dblp.l3s.de/d2r/resource/publications/conf/stoc/2003>
owl:sameAs	<http://bibsonomy.org/uri/bibtexkey/conf/stoc/DemetrescuI03/dblp>
owl:sameAs	<http://dblp.rkbexplorer.com/id/conf/stoc/DemetrescuI03>
rdfs:seeAlso	<http://dblp.uni-trier.de/db/conf/stoc/stoc2003.html#DemetrescuI03>
rdfs:seeAlso	<https://doi.org/10.1145/780542.780567>
swrc:series	<https://dblp.l3s.de/d2r/resource/conferences/stoc>
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:InProceedings
rdf:type	foaf:Document