Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Network routing on regular directed graphs from spanning factorizations   Networks with a high degree of symmetry are useful models for parallel
processor networks. In earlier papers, we defined several global communication
tasks (universal exchange, universal broadcast, universal summation) that can
be critical tasks when complex algorithms are mapped to parallel machines. We
showed that utilizing the symmetry can make network optimization a tractable
problem. In particular, we showed that Cayley graphs have the desirable
property that certain routing schemes starting from a single node can be
transferred to all nodes in a way that does not introduce conflicts. In this
paper, we define the concept of spanning factorizations and show that this
property can also be used to transfer routing schemes from a single node to all
other nodes. We show that all Cayley graphs and many (perhaps all) vertex
transitive graphs have spanning factorizations.

26
The categories of this paper are: bayes-an
10
The categories of this paper are: q-bio
15
The categories of this paper are: nucl-ex
5
The categories of this paper are: gr-qc
6
The categories of this paper are: astro-ph
20
The categories of this paper are: acc-phys
13
The categories of this paper are: quant-ph
30
The categories of this paper are: q-alg
27
The categories of this paper are: comp-gas
12
The categories of this paper are: nucl-th
8
The categories of this paper are: hep-ex
24
The categories of this paper are: dg-ga
3
The categories of this paper are: physics
19
The categories of this paper are: eess
34
The categories of this paper are: chem-ph
23
The categories of this paper are: solv-int