Author:
Munro J. Ian,Nicholson Patrick K.
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference45 articles.
1. Agrawal, R., Borgida, A., Jagadish, H.V.: Efficient management of transitive relationships in large data and knowledge bases. In: Proceedings of the ACM International Conference on Management of Data (SIGMOD), pp. 253–262. ACM Press (1989)
2. Barbay, J., Claude, F., Navarro, G.: Compact binary relation representations with rich functionality. Inf. Comput. 232, 19–37 (2013)
3. Barbay, J., He, M., Munro, J.I., Rao, S.S.: Succinct indexes for strings, binary relations and multilabeled trees. ACM Trans. Algorithms (TALG) 7(4), 52 (2011)
4. Bender, M.A., Farach-Colton, M., Pemmasani, G., Skiena, S., Sumazin, P.: Lowest common ancestors in trees and directed acyclic graphs. J. Algorithms 57(2), 75–94 (2005)
5. Brightwell, G.: The average number of linear extensions of a partial order. J. Comb. Theory Ser. A 73(2), 193–206 (1996)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献