The lattice dimension of a graph

  • Authors:
  • David Eppstein

  • Affiliations:
  • Computer Science Department, School of Information and Computer Science, University of California, Irvine, CA

  • Venue:
  • European Journal of Combinatorics
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

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 Zd.