An approximation algorithm for finding long paths in Hamiltonian graphs
type: Item
instance of: scholarly article
title: An approximation algorithm for finding long paths in Hamiltonian graphs
zbMATH Open document ID: 1067.68110
DOI: 10.1016/S0196-6774(03)00093-2
author: Sundar Vishwanathan
published in: Journal of Algorithms
publication date: 2004-10-01T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C45
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68W25
zbMATH DE Number: 2105335
MaRDI profile type: MaRDI publication profile
full work available at URL: s0196-6774(03)00093-2
OpenAlex ID: W4252035792
Recommended article: Q4952685
Recommended article: Finding long paths and cycles in sparse Hamiltonian graphs
Recommended article: On approximating the longest path in a graph
Recommended article: An extension of the multi-path algorithm for finding Hamilton cycles
Recommended article: An algorithm for finding Hamilton paths and cycles in random graphs
Recommended article: Approximation algorithms for multiple terminal, Hamiltonian path problems
Recommended article: Q3070289
Recommended article: Linear-time algorithms for finding Hamiltonian and longest \((s,t)\)-paths in \(C\)-shaped grid graphs
Recommended article: Approximation algorithms for the maximum Hamiltonian path problem with specified endpoint(s)
description: scientific article; zbMATH DE number 2105335