FHCP挑战集：哈密顿圈问题的第一组结构困难解
FHCP Challenge Set: The First Set of Structurally Difficult Instances of the Hamiltonian Cycle Problem
摘要：
介绍了由1001个哈密顿圈问题实例组成的FHCP挑战集。这个集合是第一个包含哈密顿圈问题的实例，其主要困难是底层的图形结构，而不仅仅是大小。给出了FHCP挑战集中包含的各种图的总结。FHCP挑战赛的结果的讨论，为期一年的比赛，以解决所有的FHCP挑战集的情况下，首次宣布在第59届澳大利亚数学学会年会，也包括在内。
英文摘要：
The FHCP Challenge Set, comprising of 1001 instances of Hamiltonian cycle problem, is introduced. This set is the first to contain instances of Hamiltonian cycle problem for which the primary difficulty is the underlying graph structure, rather than simply size. A summary of the kinds of graphs contained in the FHCP Challenge Set is given. A discussion of the results of the FHCP Challenge, a year-long competition to solve all instances of the FHCP Challenge Set first announced at the 59th Annual Meeting for the Australian Mathematical Society, is also included.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
