Competitive Algorithms for Layered Graph Traversal
Resource URI: https://dblp.l3s.de/d2r/resource/publications/conf/focs/FiatFKRRV91
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/conf/focs/FiatFKRRV91
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Amos_Fiat
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Dean_P._Foster
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Howard_J._Karloff
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Sundar_Vishwanathan
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Yiftach_Ravid
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Yuval_Rabani
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1109%2FSFCS.1991.185381
>
foaf:
homepage
<
https://doi.org/10.1109/SFCS.1991.185381
>
dc:
identifier
DBLP conf/focs/FiatFKRRV91
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1109%2FSFCS.1991.185381
(xsd:string)
dcterms:
issued
1991
(xsd:gYear)
rdfs:
label
Competitive Algorithms for Layered Graph Traversal
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Amos_Fiat
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Dean_P._Foster
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Howard_J._Karloff
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Sundar_Vishwanathan
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Yiftach_Ravid
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Yuval_Rabani
>
swrc:
pages
288-297
(xsd:string)
dcterms:
partOf
<
https://dblp.l3s.de/d2r/resource/publications/conf/focs/FOCS32
>
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/conf/focs/FiatFKRRV91/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/conf/focs/FiatFKRRV91
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/conf/focs/focs91.html#FiatFKRRV91
>
rdfs:
seeAlso
<
https://doi.org/10.1109/SFCS.1991.185381
>
swrc:
series
<
https://dblp.l3s.de/d2r/resource/conferences/focs
>
dc:
subject
deterministic online algorithm, competitive algorithms, upper bounds, layered graph traversal, weighted graph, searcher, target vertex, lower bounds
(xsd:string)
dc:
title
Competitive Algorithms for Layered Graph Traversal
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:InProceedings
rdf:
type
foaf:Document