The lattice dimension of a graph
Data Structures and Algorithms
2007-05-23 v1 Combinatorics
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 Z^d.
Cite
@article{arxiv.cs/0402028,
title = {The lattice dimension of a graph},
author = {David Eppstein},
journal= {arXiv preprint arXiv:cs/0402028},
year = {2007}
}
Comments
6 pages, 3 figures