Author:
Rihany Mohamad,Kedad Zoubida,Lopes Stéphane
Publisher
Springer International Publishing
Reference13 articles.
1. Bader, G.D., Hogue, C.W.: An automated method for finding molecular complexes in large protein interaction networks. BMC Bioinform. 4, 2 (2003). https://doi.org/10.1186/1471-2105-4-2
2. Campinas, S., Delbru, R., Tummarello, G.: Efficiency and precision trade-offs in graph summary algorithms. In: Proceedings of the 17th International Database Engineering & Applications Symposium, pp. 38–47. ACM (2013)
3. Čebirić, Š., et al.: Summarizing semantic graphs: a survey. VLDB J. 28(3), 295–327 (2018). https://doi.org/10.1007/s00778-018-0528-3
4. Garey, M.R., Johnson, D.S.: The rectilinear Steiner tree problem is NP-complete. SIAM J. Appl. Math. 32(4), 826–834 (1977)
5. Goasdoué, F., Guzewicz, P., Manolescu, I.: Incremental structural summarization of RDF graphs. In: EDBT 2019–22nd International Conference on Extending Database Technology (2019)