Understanding chicken walks on n × n grid: Hamiltonian paths, discrete dynamics, and rectifiable paths

By  

MATHEMATICAL METHODS IN THE APPLIED SCIENCES, Vol. 38, Iss. 15, 2015-10 ,pp. : 3346-3358

John Wiley & Sons Inc

Access to resources Recommend Favorite

Parallel construction of Hamiltonian paths for conforming tetrahedral meshes

By Liu Hui  

International Journal of Computer Mathematics, Vol. 90, Iss. 7, 2013-07 ,pp. : 1366-1372

Taylor & Francis Ltd

Access to resources Recommend Favorite

Existence and construction of Hamiltonian paths and cycles on conforming tetrahedral meshes

By Liu Hui   Zhang Linbo  

International Journal of Computer Mathematics, Vol. 88, Iss. 6, 2011-04 ,pp. : 1137-1143

Taylor & Francis Ltd

Access to resources Recommend Favorite

Finding Real-Valued Single-Source Shortest Paths in o(n3) Expected Time

By Kolliopoulos S.G.   Stein C.  

Journal of Algorithms, Vol. 28, Iss. 1, 1998-07 ,pp. : 125-141

Academic Press

Access to resources Recommend Favorite

An `All Pairs Shortest Paths' Distributed Algorithm Using 2 n 2 Messages

By Haldar S.  

Journal of Algorithms, Vol. 24, Iss. 1, 1997-07 ,pp. : 20-36

Academic Press

Access to resources Recommend Favorite