2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/31997We 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 Z^d.6 pages, 3 figuresData Structures and AlgorithmsCombinatoricsF.2.2text