Title of article
The lattice dimension of a graph
Author/Authors
Eppstein، نويسنده , , David، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2005
Pages
8
From page
585
To page
592
Abstract
We describe a polynomial time algorithm for, given an undirected graph G, finding the minimum dimension d such that G may be isometrically embedded into the d-dimensional integer lattice Zd.
Journal title
European Journal of Combinatorics
Serial Year
2005
Journal title
European Journal of Combinatorics
Record number
1548805
Link To Document