Skip to main content
Conference ProceedingsOPEN ACCESS

Isometric diamond subgraphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2009) 5417 LNCS 384-389
DOI: 10.1007/978-3-642-00219-9_37
14Citations
Citations of this article
9Readers
Mendeley users who have this article in their library.

This article is free to 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. © 2009 Springer Berlin Heidelberg.

Cite

CITATION STYLE

APA

Eppstein, D. (2009). Isometric diamond subgraphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5417 LNCS, pp. 384–389). Springer Verlag. https://doi.org/10.1007/978-3-642-00219-9_37

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free