SPEAKER: Sergei Ovchinnikov (SFSU) <br>

<br>

TITLE: The Lattice Dimension of a Graph. <br>

<br>

ABSTRACT: The lattice dimension of a graph G is the smallest
dimension d of a cubic lattice Z^d in which G can be
isometrically embedded. I'll give an explicit formula for the lattice
dimension of a tree and describe a polynomial time algorithm for
finding the lattice dimension of a partial cube.