| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 10118346 | European Journal of Combinatorics | 2005 | 8 Pages |
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.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
David Eppstein,