A New Lower Bound for the Number of Switches in Rearrangeable Networks
- 1 June 1980
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Algebraic Discrete Methods
- Vol. 1 (2) , 164-167
- https://doi.org/10.1137/0601020
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- A short proof of Minc's conjectureJournal of Combinatorial Theory, Series A, 1978
- Shifting Graphs and Their ApplicationsJournal of the ACM, 1976
- Upper bounds for permanents of $left( {0,,1}
ight)$-matricesBulletin of the American Mathematical Society, 1963