%0 Journal Article
%T Research on Hamiltonian Cycle Based on Path with Interface<br>一个由接口路径求Hamilton回路的算法研究
%A LIU Chao
%A WANG Wen-jie
%A <br>刘超
%A 王文杰
%J 计算机科学
%D 2010
%I 
%X In order to find all Hamiltonian cycles in a digraph, to begin with, it presented an encoding method for the power set, which converts the problem of Hamilton circuits into the computation of hierarchical matrix Secondly, it estimated the complexity of algorithm with the proof of Xiaerci guess.Finally, it gave the exact algorithm for CTSP.
%K Hamiltonian cycle
%K CTSP
%K Combination optimization
%K Interface path
%K Infinity paradox<br>哈密顿回路
%K 中国旅行商
%K 组合优化
%K 接口路径
%K 无穷悖论
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=64A12D73428C8B8DBFB978D04DFEB3C1&aid=A5BA4E24467499075DCB7C140551FFCE&yid=140ECF96957D60B2&vid=42425781F0B1C26E&iid=9CF7A0430CBB2DFD&sid=10828928EB89AD8E&eid=80BD0A2EF8664214&journal_id=1002-137X&journal_name=计算机科学&referenced_num=1&reference_num=22