An Efficient Parallel Algorithm for Finding Hamiltonian Cycles in Dense Directed Graphs
type: Item
instance of: scholarly article
title: An Efficient Parallel Algorithm for Finding Hamiltonian Cycles in Dense Directed Graphs
zbMATH Open document ID: 0818.68087
author: Balaji Raghavachari
author: Martin Fürer
published in: Journal of Algorithms
publication date: 1995-08-20T00:00:00Z
Mathematics Subject Classification ID: 68W15
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 742692
zbMATH Keywords: Hamiltonian cycle
zbMATH Keywords: CREW PRAM
MaRDI profile type: Publication
full work available at URL: jagm.1995.1007
OpenAlex ID: W1972912707
DOI: 10.1006/JAGM.1995.1007
description: scientific article; zbMATH DE number 742692