Isometric Diamond Subgraphs
| dc.creator | Eppstein, David | |
| dc.date | 2008-07-14 | |
| dc.date.accessioned | 2026-07-07T09:50:14Z | |
| dc.date.available | 2026-07-07T09:50:14Z | |
| dc.description | 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. | |
| dc.description | 6 pages, 4 figures. To appear at 16th Int. Symp. Graph Drawing (GD08) | |
| dc.identifier | https://arxiv.org/abs/0807.2218 | |
| dc.identifier | http://arxiv.org/abs/0807.2218 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/164871 | |
| dc.subject | Computational Geometry | |
| dc.subject | F.2.2 | |
| dc.title | Isometric Diamond Subgraphs | |
| dc.type | text |