Publisher
Springer Berlin Heidelberg
Reference6 articles.
1. Aho, A., Hopcroft, J., Ullman, J.: The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading (1974)
2. Gabow, H.N., Tarjan, R.E.: A Linear-Time Algorithm for a Special Case of Disjoint Set Union. Journal of Computer and System Sciences 30(2), 209–221 (1985)
3. Ford Jr., L.R., Fulkerson, D.R.: Flows in Networks. Princeton University Press, Princeton (1962)
4. Katriel, I., Thiel, S.: Fast bound consistency for the global cardinality constraint. Research Report MPI-I-2003-1-013, Max-Planck-Institut für Informatik, Saarbrücken, Germany (2003)
5. Lecture Notes in Computer Science;K. Mehlhorn,2000
Cited by
14 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献