A linear-processor polylog-time algorithm for shortest paths in planar graphs
Resource URI: https://dblp.l3s.de/d2r/resource/publications/conf/focs/KleinS93
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/conf/focs/KleinS93
>
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.1109%2FSFCS.1993.366861
>
foaf:
homepage
<
https://doi.org/10.1109/SFCS.1993.366861
>
dc:
identifier
DBLP conf/focs/KleinS93
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1109%2FSFCS.1993.366861
(xsd:string)
dcterms:
issued
1993
(xsd:gYear)
rdfs:
label
A linear-processor polylog-time algorithm 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:
pages
259-270
(xsd:string)
dcterms:
partOf
<
https://dblp.l3s.de/d2r/resource/publications/conf/focs/FOCS34
>
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/conf/focs/KleinS93/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/conf/focs/KleinS93
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/conf/focs/focs93.html#KleinS93
>
rdfs:
seeAlso
<
https://doi.org/10.1109/SFCS.1993.366861
>
swrc:
series
<
https://dblp.l3s.de/d2r/resource/conferences/focs
>
dc:
subject
separators, linear-processor polylog-time algorithm, shortest paths, planar graphs, directed planar graphs, bounded-genus graphs, 2-dimensional overlap graphs, decomposition tree
(xsd:string)
dc:
title
A linear-processor polylog-time algorithm for shortest paths in planar graphs
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:InProceedings
rdf:
type
foaf:Document