An efficient parallel strategy for the two-fixed-endpoint Hamiltonian path problem on distance-hereditary graphs (Q1881305)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An efficient parallel strategy for the two-fixed-endpoint Hamiltonian path problem on distance-hereditary graphs |
scientific article; zbMATH DE number 2106041
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An efficient parallel strategy for the two-fixed-endpoint Hamiltonian path problem on distance-hereditary graphs |
scientific article; zbMATH DE number 2106041 |
Statements
An efficient parallel strategy for the two-fixed-endpoint Hamiltonian path problem on distance-hereditary graphs (English)
0 references
4 October 2004
0 references
algorithms
0 references
data structure
0 references
distance-hereditary graphs
0 references
Hamiltonian path problem
0 references
PRAM
0 references
