Finding long paths and cycles in sparse Hamiltonian graphs
type: Item
instance of: scholarly article
title: Finding long paths and cycles in sparse Hamiltonian graphs
zbMATH Open document ID: 1296.05114
DOI: 10.1145/335305.335368
author: Carlos Subi
author: Tomás Feder
author: Rajeev Motwani
published in: Proceedings of the thirty-second annual ACM symposium on Theory of computing
publication date: 2014-09-26T00:00:00Z
Mathematics Subject Classification ID: 05C45
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 05C40
zbMATH DE Number: 6348022
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1145/335305.335368
OpenAlex ID: W2084421815
Recommended article: An approximation algorithm for finding long paths in Hamiltonian graphs
Recommended article: Finding large cycles in Hamiltonian graphs
Recommended article: Finding Hamilton cycles in sparse random graphs
Recommended article: Q4952685
Recommended article: Q5413900
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: Long cycles in Hamiltonian graphs
Recommended article: Long cycles in graphs without Hamiltonian paths
description: scientific article