The complexity of counting self-avoiding walks in subgraphs of two-dimensional grids and hypercubes

By Liskiewicz M.   Ogihara M.   Toda S.  

Theoretical Computer Science, Vol. 304, Iss. 1, 2003-07 ,pp. : 129-156

Elsevier

Access to resources Recommend Favorite

Embedding of Binomial Trees in Hypercubes with Link Faults

By Wu J.   Fernandez E.B.   Luo Y.  

Journal of Parallel and Distributed Computing, Vol. 54, Iss. 1, 1998-10 ,pp. : 59-74

Academic Press

Access to resources Recommend Favorite

Embedding Hamiltonian Cycles into Folded Hypercubes with Faulty Links

By Wang D.  

Journal of Parallel and Distributed Computing, Vol. 61, Iss. 4, 2001-04 ,pp. : 545-564

Academic Press

Access to resources Recommend Favorite

Embedding Large Complete Binary Trees in Hypercubes with Load Balancing

By Efe K.  

Journal of Parallel and Distributed Computing, Vol. 35, Iss. 1, 1996-05 ,pp. : 104-109

Academic Press

Access to resources Recommend Favorite

Some permutation routing algorithms for low-dimensional hypercubes

By Hwang F.K.   Yao Y.C.   Dasgupta B.  

Theoretical Computer Science, Vol. 270, Iss. 1, 2002-01 ,pp. : 111-124

Elsevier

Access to resources Recommend Favorite