Optimal Parallel Algorithm for the Hamiltonian Cycle Problem on Dense Graphs
Resource URI: https://dblp.l3s.de/d2r/resource/publications/conf/focs/DahlhausHK88
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/conf/focs/DahlhausHK88
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Elias_Dahlhaus
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Marek_Karpinski
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/P%E2%88%9A%C2%A9ter_Hajnal
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1109%2FSFCS.1988.21936
>
foaf:
homepage
<
https://doi.org/10.1109/SFCS.1988.21936
>
dc:
identifier
DBLP conf/focs/DahlhausHK88
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1109%2FSFCS.1988.21936
(xsd:string)
dcterms:
issued
1988
(xsd:gYear)
rdfs:
label
Optimal Parallel Algorithm for the Hamiltonian Cycle Problem on Dense Graphs
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Elias_Dahlhaus
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Marek_Karpinski
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/P%E2%88%9A%C2%A9ter_Hajnal
>
swrc:
pages
186-193
(xsd:string)
dcterms:
partOf
<
https://dblp.l3s.de/d2r/resource/publications/conf/focs/FOCS29
>
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/conf/focs/DahlhausHK88/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/conf/focs/DahlhausHK88
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/conf/focs/focs88.html#DahlhausHK88
>
rdfs:
seeAlso
<
https://doi.org/10.1109/SFCS.1988.21936
>
swrc:
series
<
https://dblp.l3s.de/d2r/resource/conferences/focs
>
dc:
subject
NP-complete, optimal parallel algorithm, Hamiltonian cycle problem, dense graphs, vertex, graph, concurrent-read-exclusive-write parallel random-access machine, polylogarithmic factor, perfect matching
(xsd:string)
dc:
title
Optimal Parallel Algorithm for the Hamiltonian Cycle Problem on Dense Graphs
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:InProceedings
rdf:
type
foaf:Document