[RDF data]
Home | Example Publications
PropertyValue
dcterms:bibliographicCitation <http://dblp.uni-trier.de/rec/bibtex/journals/algorithmica/KleinS98>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Philip_N._Klein>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Sairam_Subramanian>
foaf:homepage <http://dx.doi.org/doi.org%2F10.1007%2FPL00009223>
foaf:homepage <https://doi.org/10.1007/PL00009223>
dc:identifier DBLP journals/algorithmica/KleinS98 (xsd:string)
dc:identifier DOI doi.org%2F10.1007%2FPL00009223 (xsd:string)
dcterms:issued 1998 (xsd:gYear)
swrc:journal <https://dblp.l3s.de/d2r/resource/journals/algorithmica>
rdfs:label A Fully Dynamic Approximation Scheme for Shortest Paths in Planar Graphs. (xsd:string)
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Philip_N._Klein>
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Sairam_Subramanian>
swrc:number 3 (xsd:string)
swrc:pages 235-249 (xsd:string)
owl:sameAs <http://bibsonomy.org/uri/bibtexkey/journals/algorithmica/KleinS98/dblp>
owl:sameAs <http://dblp.rkbexplorer.com/id/journals/algorithmica/KleinS98>
rdfs:seeAlso <http://dblp.uni-trier.de/db/journals/algorithmica/algorithmica22.html#KleinS98>
rdfs:seeAlso <https://doi.org/10.1007/PL00009223>
dc:subject Dynamic algorithm, Graph algorithm, Shortest path, Minimum-cost path, Planar graph; Key words; Dynamic algorithm, Graph algorithm, Shortest path, Minimum-cost path, Planar graph. (xsd:string)
dc:title A Fully Dynamic Approximation Scheme for Shortest Paths in Planar Graphs. (xsd:string)
dc:type <http://purl.org/dc/dcmitype/Text>
rdf:type swrc:Article
rdf:type foaf:Document
swrc:volume 22 (xsd:string)