On the Parallel Complexity of Hamiltonian Cycle and Matching Problem on Dense Graphs (Q4275334)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 484750
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the Parallel Complexity of Hamiltonian Cycle and Matching Problem on Dense Graphs |
scientific article; zbMATH DE number 484750 |
Statements
On the Parallel Complexity of Hamiltonian Cycle and Matching Problem on Dense Graphs (English)
0 references
13 March 1994
0 references
matching
0 references
dense graphs
0 references
Hamiltonian cycle
0 references
CREW-PRAM
0 references
linear number of processors
0 references
0.8932308554649353
0 references
0.8715605735778809
0 references
0.8665837049484253
0 references
