✦ LIBER ✦

Parallel sorting on cayley graphs

✍ Scribed by Daniel M. Gordon

Publisher: Springer
Year: 1991
Tongue: English
Weight: 604 KB
Volume: 6
Category: Article
ISSN: 0178-4617
DOI: 10.1007/bf01759059

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On quasi-Cayley graphs

✍ Ginette Gauyacq 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 925 KB

WC introduce the concept of quasi-Cayley graphs, a class of vertex-transitive graphs which contains Cayley graphs, and study some of their properties. By finding vertex-transitive graphs which are not quasi-Cayley graphs we give a negative answer to a question by Fuller and Krishnamurthy on the quas

On Perfect Cayley Graphs

✍ Agnes V. Dizon-Garciano; Ian June L. Garces; Mari-Jo P. Ruiz 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 460 KB

On parallel integer sorting

✍ Sanguthevar Rajasekaran; Sandeep Sen 📂 Article 📅 1992 🏛 Springer-Verlag 🌐 English ⚖ 875 KB

Channel assignment on Cayley graphs

✍ Patrick Bahls 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 100 KB

We address various channel assignment problems on the Cayley graphs of certain groups, computing the frequency spans by applying group theoretic techniques. In particular, we show that if G is the Cayley graph of an n-generated group with a certain kind of presentation, then (G; k, 1) ≤ 2(k +n-1). F

Some problems on Cayley graphs

✍ Elena Konstantinova 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 189 KB

On edge-hamiltonian Cayley graphs

✍ Ulrike Baumann 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 667 KB