论文信息 - A lower bound on strictly non-blocking networks - 字舞流文

A lower bound on strictly non-blocking networks

We prove that a strictly non-blockingn-connector of depthk must haveω(n1+1/(k−1)) edges.

[1] Charles Clos,et al. A study of non-blocking switching networks , 1953 .

[2] Leslie G. Valiant,et al. Shifting Graphs and Their Applications , 1976, J. ACM.