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

Author： Liskiewicz M. Ogihara M. Toda S.

Publisher： Elsevier

ISSN： 0304-3975

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

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Dilation-5 Embedding of 3-Dimensional Grids into Hypercubes

By Chan M.Y. Chin F. Chu C.N. Mak W.K.

Journal of Parallel and Distributed Computing, Vol. 33, Iss. 1, 1996-02 ,pp. : 98-106

Academic Press

Access to resources Recommend Favorite

Fabrication of focused two-dimensional grids

By Makarova O. V. Mancini D. C. Moldovan N. Divan R. Zyryanov V. N. Tang C.-M.

Microsystem Technologies, Vol. 10, Iss. 6-7, 2004-10 ,pp. : 540-543

Springer Publishing Company

Access to resources Recommend Favorite

The rectangle complexity of functions on two-dimensional lattices

By Sander J.W. Tijdeman R.

Theoretical Computer Science, Vol. 270, Iss. 1, 2002-01 ,pp. : 857-863

Elsevier

Access to resources Recommend Favorite

Parameterized complexity of finding subgraphs with hereditary properties

By Khot S. Raman V.

Theoretical Computer Science, Vol. 289, Iss. 2, 2002-10 ,pp. : 997-1008

Elsevier

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