Efficient Parallel Algorithms for Testing Connectivity and Finding Disjoint s-t Paths in Graphs (Extended Summary)
Resource URI: https://dblp.l3s.de/d2r/resource/publications/conf/focs/KhullerS89
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/conf/focs/KhullerS89
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Baruch_Schieber
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Samir_Khuller
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1109%2FSFCS.1989.63492
>
foaf:
homepage
<
https://doi.org/10.1109/SFCS.1989.63492
>
dc:
identifier
DBLP conf/focs/KhullerS89
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1109%2FSFCS.1989.63492
(xsd:string)
dcterms:
issued
1989
(xsd:gYear)
rdfs:
label
Efficient Parallel Algorithms for Testing Connectivity and Finding Disjoint s-t Paths in Graphs (Extended Summary)
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Baruch_Schieber
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Samir_Khuller
>
swrc:
pages
288-293
(xsd:string)
dcterms:
partOf
<
https://dblp.l3s.de/d2r/resource/publications/conf/focs/FOCS30
>
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/conf/focs/KhullerS89/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/conf/focs/KhullerS89
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/conf/focs/focs89.html#KhullerS89
>
rdfs:
seeAlso
<
https://doi.org/10.1109/SFCS.1989.63492
>
swrc:
series
<
https://dblp.l3s.de/d2r/resource/conferences/focs
>
dc:
subject
k-edge disjoint paths, parallel algorithms, testing connectivity, disjoint s-t paths, graphs, CRCW PRAM, optimal speedup algorithm, k-vertex connectivity
(xsd:string)
dc:
title
Efficient Parallel Algorithms for Testing Connectivity and Finding Disjoint s-t Paths in Graphs (Extended Summary)
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:InProceedings
rdf:
type
foaf:Document