This paper studies linear layouts of generalized hypercubes, a d-dimensional c-ary clique and a d-dimensional c-ary array, and evaluates the bisection width, cut width, and total edge length of them, which are important parameters to measure the complexity of them in terms of a linear layout.
CITATION STYLE
Nakano, K. (1994). Linear layouts of generalized hypercubes. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 790 LNCS, pp. 364–375). Springer Verlag. https://doi.org/10.1007/3-540-57899-4_66
Mendeley helps you to discover research relevant for your work.