On embedding 2-dimensional toroidal grids into de Bruijn graphs with clocked congestion one

1Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

For integers m, d, D with m≥3, d≥2, and D≥2, let T(m) be a 2-dimensional quadratic toroidal grid with side length m and let B(d,D) be the base d, dimension D de Bruijn graph; assume that |T(m)|=|B(d, D)|. The starting point for our investigations is the observation that, for m, D even, embeddings f:T(m)→B(d, D) with load 1, expansion 1, and dilation D/2 can easily be found (and have previously been described in the literature). In the present paper, we pose the question whether or not there exist embeddings f:T(m)→B(d, D) with these properties and with clocked congestion 1. We prove results implying a positive answer to this question when d is greater than two. For d=2, we do not have a complete answer, but present partial results.

Cite

CITATION STYLE

APA

Andreae, T., Nölle, M., Rempel, C., & Schreiber, G. (1996). On embedding 2-dimensional toroidal grids into de Bruijn graphs with clocked congestion one. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1120, pp. 316–327). Springer Verlag. https://doi.org/10.1007/3-540-61576-8_92

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