Author:
Ramneantu Emanuel,Strehl Tino,Grobe Jens,Gijzen Marlou,Helfrich Stephan,Mallick Arijit,Fäßler Victor
Publisher
Springer Fachmedien Wiesbaden
Reference40 articles.
1. Graph distance contest—icpr 2016 (2016). URL https://gdc2016.greyc.fr//#ged
2. Semantic code clone detection using abstract memory states and program dependency graphs. In: 2018 4th International Conference on Web Research (ICWR). IEEE (2018)
3. Anatoli Kalysch Oskar Milisterfer, M.P.T.M.: Tackling android’s native library malware with robust, efficient and accurate similarity measures. In: Proceedings of the 13th International Conference on Availability, Reliability and Security, ARES 2018, pp. 58:1–58:10. Friedrich-Alexander-Universität Erlangen-Nürnberg, Department of Computer Science, IT Security Infrastructures Lab, Software Security Research Group, ACM (2018). URL https://doi.org/10.1145/3230833.3232802
4. Blumenthal, D.B., Gamper, J.: On the exact computation of the graph edit distance. Pattern Recogn. Lett. 134(C), 46–57 (2020). DOI https://doi.org/10.1016/j.patrec.2018.05.002. URL https://doi.org/10.1016/j.patrec.2018.05.002
5. Boeres, M.C., Ribeiro, C.C., Bloch, I.: A randomized heuristic for scene recognition by graph matching. In: C.C. Ribeiro, S.L. Martins (eds.) Experimental and Efficient Algorithms, pp. 100–113. Springer Berlin Heidelberg, Berlin, Heidelberg (2004)