Author:
Goel Ashish,Kapralov Michael,Khanna Sanjeev
Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Discrete Mathematics and Combinatorics
Reference17 articles.
1. G. Aggarwal, R. Motwani, D. Shah, and A. Zhu: Switch scheduling via randomized edge coloring, FOCS, 2003.
2. A. A. Benczúr, and D. R. Karger: Approximating s-t minimum cuts in ~O (n2) time, Proceedings of the 28th annual ACM symposium on Theory of computing, 1996.
3. G. Birkhoff: Tres observaciones sobre el algebra lineal, Univ. Nac. Tucumán Rev. Ser. A
5 (1946), 147–151.
4. B. Bollobás: Modern graph theory, Springer, 1998.
5. R. Cole and J. E. Hopcroft: On edge coloring bipartite graphs. SIAM J. Comput. 11 (1982), 540–546.