Paper Info
Title
A unified scheme for routing in expander based networks
Abstract
We propose a scheme for constructing expander based networks, by starting with a skeleton (directed and weighted) graph, and fleshing out its edges into expanders. Particular cases which can be built this way are: the multibutterfly, the multi-Beneš, a certain fat-tree and a superconcentrator.
Year
DOI
Venue
1994
10.1007/3-540-57811-0_11
CIAC
Keywords
Field
DocType
unified scheme
Graph,Discrete mathematics,Complete bipartite graph,Combinatorics,Computer science,Bipartite graph
Conference
ISBN
Citations 
PageRank 
3-540-57811-0
0
0.34
References 
Authors
6
2
Name
Order
Citations
PageRank
shimon even12873981.78
Ami Litman224049.78