Author:
Charon Irène,Hudry Olivier
Publisher
Springer Science and Business Media LLC
Subject
Management Science and Operations Research,General Decision Sciences
Reference294 articles.
1. Adám, A. (1964). Problem. In Theory of graphs and its applications. Proc. Coll. Smolenice, Czech. Acad. Sci. Publ.
2. Adler, I., Alon, N., & Ross, S. M. (2001). On the number of Hamiltonian paths in tournaments. Random Structures and Algorithms, 18, 291–296.
3. Ailon, N., & Alon, N. (2007). Hardness of fully dense problems. Information and Computation, 205, 117–1129.
4. Ailon, N., Charikar, M., & Newman, A. (2005). Aggregating inconsistent information: ranking and clustering. In Proceedings of the 37th annual ACM symposium on theory of computing (STOC) (pp. 684–693).
5. Ali, I., Cook, W. D., & Kress, M. (1986). On the minimum violations ranking of a tournament. Management Science, 32, 660–674.
Cited by
46 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献