The lattice dimension of a graph

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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.
6 pages, 3 figures

Keywords

Data Structures and Algorithms, Combinatorics, F.2.2

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/31997

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/cs/0402028
 http://arxiv.org/abs/cs/0402028
 Eur. J. Combinatorics 26(6):585-592, 2005
 doi:10.1016/j.ejc.2004.05.001

Collections

arXiv