Comparing star and pancake networks

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

Abstract

Low dilation embeddings are used to compare similarities between star and pancake networks. The pancake network of dimension n, Pn, has n nodes, one for each permutation, and an undirected edge between permutations (nodes) when some prefix reversal transforms one permutation into the other. The star network of dimension n, Sn, has n! nodes, one for each permutation, and an undirected edge between permutations (nodes) when the exchange of the first element with some other element transforms one permutation into the other. Comparisons with the burnt pancake network are also discussed. The burnt pancake network, BPn, has 2n-n! nodes, one for each signed permutation, and an undirected edge between signed permutations (nodes) when some prefix reversal transforms one signed permutation into the other, and all symbols in the reversed prefix change sign. Some of the embeddings shown are: · Pn dil 1 S2n, · S2n dil 1 P(n3-4n2 5n+4)/2 · BPndil 1 n S2s, · S2n dil 2 P 2n-2. © 2012 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Morales, L., & Sudborough, I. H. (2002). Comparing star and pancake networks. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2566 LNCS, 18–36. https://doi.org/10.1007/3-540-36377-7_2

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