DocumentCode
2892266
Title
Explicit construction of natural bounded concentrators
Author
Morgenstern, Moshe
Author_Institution
Dept. of Comput. Sci., British Columbia Univ., Vancouver, BC, Canada
fYear
1991
fDate
1-4 Oct 1991
Firstpage
392
Lastpage
397
Abstract
The first known direct construction for linear families of bounded concentrators is given. The construction is explicit, and the results are simple natural bounded concentrators
Keywords
line concentrators; switching networks; direct construction; explicit construction; linear families; natural bounded concentrators; Bipartite graph; Computer science; Graph theory; Joining processes; Mathematics; Sorting;
fLanguage
English
Publisher
ieee
Conference_Titel
Foundations of Computer Science, 1991. Proceedings., 32nd Annual Symposium on
Conference_Location
San Juan
Print_ISBN
0-8186-2445-0
Type
conf
DOI
10.1109/SFCS.1991.185396
Filename
185396
Link To Document