Author:
Hosaagrahara Madhusudan,Sethu Harish
Publisher
Springer Science and Business Media LLC
Subject
Electrical and Electronic Engineering
Reference17 articles.
1. T.E. Anderson, S.S. Owicki, J.B. Saxe and C.P. Thacker, High-speed switch scheduling for local-area networks. ACM Trans. Comput. Syst. 11(4) (1993) 319–352.
2. D. Angluin and L.G. Valiant, Fast probabilistic algorithms for hamiltonian circuits and matchings, in: ACM STOC, Boulder, CO, USA (1977), pp. 30–41. ACM Press.
3. A. Charny, P. Krishna, N. Patel and R. Simcoe, Algorithms for providing bandwidth and delay guarantees in input-buffered crossbars with speedup. in: Proc. 6-th Int’l Wksp. on Quality-of-Service (IWQoS 98), Napa, CA, USA (1998) pp. 235–244.
4. N. Gura and H. Eberle, The least choice first (lcf) scheduling method for high-speed network switches, in: Proc. IEEE Intl. Parallel and Distributed Processing Symposium, Ft. Lauderdale, FL, USA (2002) pp. 51–60.
5. Hopcroft and Karp, An $$n^\frac52$$ algorithm for maximum matchings in bipartite graphs. SIAM J. on Computing 2(4) (1973) 225.
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献