Finding strongly connected components in parallel using o(log2n) reachability queries.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/conf/spaa/Schudy08
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/conf/spaa/Schudy08
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Warren_Schudy
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1145%2F1378533.1378560
>
foaf:
homepage
<
https://doi.org/10.1145/1378533.1378560
>
dc:
identifier
DBLP conf/spaa/Schudy08
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1145%2F1378533.1378560
(xsd:string)
dcterms:
issued
2008
(xsd:gYear)
rdfs:
label
Finding strongly connected components in parallel using o(log2n) reachability queries.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Warren_Schudy
>
swrc:
pages
146-151
(xsd:string)
dcterms:
partOf
<
https://dblp.l3s.de/d2r/resource/publications/conf/spaa/2008
>
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/conf/spaa/Schudy08/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/conf/spaa/Schudy08
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/conf/spaa/spaa2008.html#Schudy08
>
rdfs:
seeAlso
<
https://doi.org/10.1145/1378533.1378560
>
swrc:
series
<
https://dblp.l3s.de/d2r/resource/conferences/spaa
>
dc:
subject
graph algorithms, parallel algorithms, strongly connected components, topological sort, transitive closure bottleneck
(xsd:string)
dc:
title
Finding strongly connected components in parallel using o(log2n) reachability queries.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:InProceedings
rdf:
type
foaf:Document