Randomized minimum spanning tree algorithms using exponentially fewer random bits.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/journals/talg/PettieR08
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/journals/talg/PettieR08
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Seth_Pettie
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Vijaya_Ramachandran
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1145%2F1328911.1328916
>
foaf:
homepage
<
https://doi.org/10.1145/1328911.1328916
>
dc:
identifier
DBLP journals/talg/PettieR08
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1145%2F1328911.1328916
(xsd:string)
dcterms:
issued
2008
(xsd:gYear)
swrc:
journal
<
https://dblp.l3s.de/d2r/resource/journals/talg
>
rdfs:
label
Randomized minimum spanning tree algorithms using exponentially fewer random bits.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Seth_Pettie
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Vijaya_Ramachandran
>
swrc:
number
1
(xsd:string)
swrc:
pages
5:1-5:27
(xsd:string)
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/journals/talg/PettieR08/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/journals/talg/PettieR08
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/journals/talg/talg4.html#PettieR08
>
rdfs:
seeAlso
<
https://doi.org/10.1145/1328911.1328916
>
dc:
subject
Graph algorithms, minimum spanning trees, random sampling
(xsd:string)
dc:
title
Randomized minimum spanning tree algorithms using exponentially fewer random bits.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:Article
rdf:
type
foaf:Document
swrc:
volume
4
(xsd:string)