Chapter

Graph Drawing

Volume 5417 of the series Lecture Notes in Computer Science pp 384-389

Isometric Diamond Subgraphs

  • David EppsteinAffiliated withLancaster UniversityComputer Science Department, University of California

* Final gross prices may vary according to local VAT.

Get Access

Abstract

We test in polynomial time whether a graph embeds in a distance-preserving way into the hexagonal tiling, the three-dimensional diamond structure, or analogous higher-dimensional structures.