[RDF data]
Home | Example Publications
PropertyValue
dcterms:bibliographicCitation <http://dblp.uni-trier.de/rec/bibtex/conf/focs/Bernstein09>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Aaron_Bernstein>
foaf:homepage <http://dx.doi.org/doi.org%2F10.1109%2FFOCS.2009.16>
foaf:homepage <https://doi.org/10.1109/FOCS.2009.16>
dc:identifier DBLP conf/focs/Bernstein09 (xsd:string)
dc:identifier DOI doi.org%2F10.1109%2FFOCS.2009.16 (xsd:string)
dcterms:issued 2009 (xsd:gYear)
rdfs:label Fully Dynamic (2 + epsilon) Approximate All-Pairs Shortest Paths with Fast Query and Close to Linear Update Time. (xsd:string)
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Aaron_Bernstein>
swrc:pages 693-702 (xsd:string)
dcterms:partOf <https://dblp.l3s.de/d2r/resource/publications/conf/focs/2009>
owl:sameAs <http://bibsonomy.org/uri/bibtexkey/conf/focs/Bernstein09/dblp>
owl:sameAs <http://dblp.rkbexplorer.com/id/conf/focs/Bernstein09>
rdfs:seeAlso <http://dblp.uni-trier.de/db/conf/focs/focs2009.html#Bernstein09>
rdfs:seeAlso <https://doi.org/10.1109/FOCS.2009.16>
swrc:series <https://dblp.l3s.de/d2r/resource/conferences/focs>
dc:subject graph algorithms, dynamic algorithms, approximation algorithms, shortest paths (xsd:string)
dc:title Fully Dynamic (2 + epsilon) Approximate All-Pairs Shortest Paths with Fast Query and Close to Linear Update Time. (xsd:string)
dc:type <http://purl.org/dc/dcmitype/Text>
rdf:type swrc:InProceedings
rdf:type foaf:Document