How to Find Long Paths Efficiently
暂无分享，去创建一个
[1] Stephen C. Locke. Relative lengths of paths and cycles in k-connected graphs , 1982, J. Comb. Theory, Ser. B.
[2] George L. Nemhauser,et al. A polynomial algorithm for maximum weighted vertex packings on graphs without long odd cycles , 1981, Math. Program..
[3] Alon Itai,et al. Finding a minimum circuit in a graph , 1977, STOC '77.
[4] Paul Erdös,et al. On a Problem in Graph Theory , 1963, The Mathematical Gazette.