Probabilistic Analysis of a Parallel Algorithm for Finding the Lexicographically First Depth First Search Tree in a Dense Random Graph.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/journals/rsa/DyerF91a
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/journals/rsa/DyerF91a
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Alan_M._Frieze
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Martin_E._Dyer
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1002%2Frsa.3240020207
>
foaf:
homepage
<
https://doi.org/10.1002/rsa.3240020207
>
dc:
identifier
DBLP journals/rsa/DyerF91a
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1002%2Frsa.3240020207
(xsd:string)
dcterms:
issued
1991
(xsd:gYear)
swrc:
journal
<
https://dblp.l3s.de/d2r/resource/journals/rsa
>
rdfs:
label
Probabilistic Analysis of a Parallel Algorithm for Finding the Lexicographically First Depth First Search Tree in a Dense Random Graph.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Alan_M._Frieze
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Martin_E._Dyer
>
swrc:
number
2
(xsd:string)
swrc:
pages
233-240
(xsd:string)
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/journals/rsa/DyerF91a/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/journals/rsa/DyerF91a
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/journals/rsa/rsa2.html#DyerF91a
>
rdfs:
seeAlso
<
https://doi.org/10.1002/rsa.3240020207
>
dc:
title
Probabilistic Analysis of a Parallel Algorithm for Finding the Lexicographically First Depth First Search Tree in a Dense Random Graph.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:Article
rdf:
type
foaf:Document
swrc:
volume
2
(xsd:string)