The lattice dimension of a graph
<|reference_start|>The lattice dimension of a graph: 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.<|reference_end|>
@article{eppstein2004the,
    title={The lattice dimension of a graph},
    author={David Eppstein},
    journal={Eur. J. Combinatorics 26(6):585-592, 2005},
    year={2004},
    doi={10.1016/j.ejc.2004.05.001},
    archivePrefix={arXiv},
    eprint={cs/0402028},
    primaryClass={cs.DS math.CO}
}