An efficient parallel strategy for the two-fixed-endpoint Hamiltonian path problem on distance-hereditary graphs
type: Item
instance of: scholarly article
title: An efficient parallel strategy for the two-fixed-endpoint Hamiltonian path problem on distance-hereditary graphs
zbMATH Open document ID: 1106.68084
author: Sun-Yuan Hsieh
published in: Journal of Parallel and Distributed Computing
publication date: 2004-10-04T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68P05
Mathematics Subject Classification ID: 68W10
zbMATH DE Number: 2106041
zbMATH Keywords: algorithms
zbMATH Keywords: data structure
zbMATH Keywords: distance-hereditary graphs
zbMATH Keywords: Hamiltonian path problem
zbMATH Keywords: PRAM
MaRDI profile type: Publication
full work available at URL: j.jpdc.2004.03.014
OpenAlex ID: W2027029476
DOI: 10.1016/J.JPDC.2004.03.014
description: scientific article; zbMATH DE number 2106041