Skip to main content
Journal Article

Optimal 2-dimensional 3-dispersion lattices

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2003) 2643 216-225
DOI: 10.1007/3-540-44828-4_23
8Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We examine 2-dimensional 3-dispersion lattice interleaves in three connectivity models: the rectangular grid with either 4 or 8 neighbors, and the hexagonal grid. We provide tight lower bounds on the interleaving degree in all cases and show lattices which achieve the bounds. © Springer-Verlag Berlin Heidelberg 2003.

Cite

CITATION STYLE

APA

Schwartz, M., & Etzion, T. (2003). Optimal 2-dimensional 3-dispersion lattices. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2643, 216–225. https://doi.org/10.1007/3-540-44828-4_23

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