The lattice dimension of a graph

Simple item page
dc.creatorEppstein, David
dc.date2004-02-13
dc.date.accessioned2026-07-07T03:20:54Z
dc.date.available2026-07-07T03:20:54Z
dc.descriptionWe 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.
dc.description6 pages, 3 figures
dc.identifierhttps://arxiv.org/abs/cs/0402028
dc.identifierhttp://arxiv.org/abs/cs/0402028
dc.identifierEur. J. Combinatorics 26(6):585-592, 2005
dc.identifierdoi:10.1016/j.ejc.2004.05.001
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/31997
dc.subjectData Structures and Algorithms
dc.subjectCombinatorics
dc.subjectF.2.2
dc.titleThe lattice dimension of a graph
dc.typetext

Files

Collections

arXiv