arXiv Open Access 2008

Isometric Diamond Subgraphs

David Eppstein

Lihat Sumber

Abstrak

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.

Topik & Kata Kunci

cs.CG

Penulis (1)

David Eppstein

Format Sitasi

APA MLA BibTeX

Eppstein, D. (2008). Isometric Diamond Subgraphs. https://arxiv.org/abs/0807.2218

Akses Cepat

Lihat di Sumber

Informasi Jurnal

Tahun Terbit: 2008
Bahasa: en
Sumber Database: arXiv
Akses: Open Access ✓