Publisher
Springer Science and Business Media LLC
Subject
Artificial Intelligence,Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Software
Reference24 articles.
1. Alt, H., Blum, N., Mehlhorn, K., & Paul, M. (1991). Computing a maximum cardinality matching in a bipartite graph in time $O(n^{1.5} \sqrt {m / \log n})$ . Information Processing Letters, 37, 237–240.
2. Beldiceanu, N., Carlsson, M., & Rampon, J.-X. (2006). Global constraint catalog. Technical Report T2005-08, Swedish Institute of Computer Science, 15 Sept 2006.
3. Beldiceanu, N., Katriel, I., & Thiel, S. (2004). Filtering algorithms for the SAME constraint. Lecture Notes in Computer Science, 3011, 65–79.
4. Berge, C. (1957). Two theorems in graph theory. Proceedings of the National Academy of Sciences of the United States of America, 43, 842–844.
5. Cormen, T.H., Leiserson, C.E., Rivest, R.L., & Stein, C. (2001). Introduction to algorithms (2nd ed.). Cambridge, MA: MIT Press/McGraw-Hill.
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献