Isometric Diamond Subgraphs
Computational Geometry
2008-07-15 v1
Abstract
We describe polynomial time algorithms for determining whether an undirected graph may be embedded in a distance-preserving way into the hexagonal tiling of the plane, the diamond structure in three dimensions, or analogous structures in higher dimensions. The graphs that may be embedded in this way form an interesting subclass of the partial cubes.
Cite
@article{arxiv.0807.2218,
title = {Isometric Diamond Subgraphs},
author = {David Eppstein},
journal= {arXiv preprint arXiv:0807.2218},
year = {2008}
}
Comments
6 pages, 4 figures. To appear at 16th Int. Symp. Graph Drawing (GD08)