Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Discrete Mathematics and Combinatorics
Reference18 articles.
1. Aggarwal, A., Bar-Noy, A., Coppersmith, D., Ramaswami, R., Schieber, B., Sudan, M.: Efficient routing in optical networks. J. ACM 43(6), 973–1001 (1996)
2. Alon, N., Chung, F.R.K., Graham, R.L.: Routing permutations on graphs via matchings. SIAM J. Discret. Math. 7(3), 513–530 (1994)
3. Alon, N., Spencer, J.H.: The probabilistic method. In: Wiley-Interscience Series in Discrete Mathematics and Optimization, 4th edn. Wiley, Hoboken (2016)
4. Broder, A.Z., Frieze, A.M., Upfal, E.: Existence and construction of edge-disjoint paths on expander graphs. SIAM J. Comput. 23(5), 976–989 (1994)
5. Draganić, N., Krivelevich, M., Nenadov, R.: Rolling backwards can move you forward: on embedding problems in sparse expanders. Trans. Am. Math. Soc. 375(7), 5195–5216 (2022)