ON TESTING HAMILTONICITY OF GRAPHS Alexander Barvinok July 15, 2014 Abstract. Let us fix a function f (n) = o(n ln n) and reals 0 ≤ α < β ≤ 1. We present a polynomial time algorithm which, given a directed graph G - Permutation matrix - Document - PDFSEARCH.IO

First Page	Meta Content
	ON TESTING HAMILTONICITY OF GRAPHS Alexander Barvinok July 15, 2014 Abstract. Let us fix a function f (n) = o(n ln n) and reals 0 ≤ α < β ≤ 1. We present a polynomial time algorithm which, given a directed graph G Add to Reading List Document Date: 2014-08-27 10:06:40 Open Document File Size: 124,78 KB Share Result on Facebook

ON TESTING HAMILTONICITY OF GRAPHS Alexander Barvinok July 15, 2014 Abstract. Let us fix a function f (n) = o(n ln n) and reals 0 ≤ α < β ≤ 1. We present a polynomial time algorithm which, given a directed graph GAdd to Reading List