Open Access
| Issue |
EPJ Web Conf.
Volume 341, 2025
2nd International Conference on Advent Trends in Computational Intelligence and Communication Technologies (ICATCICT 2025)
|
|
|---|---|---|
| Article Number | 01014 | |
| Number of page(s) | 11 | |
| DOI | https://doi.org/10.1051/epjconf/202534101014 | |
| Published online | 20 November 2025 | |
- D. B. West, Introduction to Graph Theory, 2nd ed. Upper Saddle River, NJ, USA: Prentice Hall, 2001. [Google Scholar]
- F. Emmert-Streib, M. Dehmer, and Y. Shi, "Fifty years of graph matching, network alignment and network comparison," Inf. Sci., vol. 346-347, pp. 180-197, Jun. 2016. [Google Scholar]
- H. Bunke, "On a relation between graph edit distance and maximum common subgraph," Pattern Recognit. Lett., vol. 18, no. 8, pp. 689-694, Aug. 1997. [Google Scholar]
- H. Sun and D. Vagnozzi, "Three Hardness Results for Graph Similarity Problems," arXiv Preprint, Sept. 2023. https://doi.org/10.48550/arXiv.2309.03810 [Google Scholar]
- J. Köbler, U. Schöning, and J. Torân, The Graph Isomorphism Problem: Its Structural Complexity. Boston, MA, USA: Birkhäuser, 1993. [Google Scholar]
- J. Wang, H. Zhu, H. Xie, F. L. Wang, X. Xu, and Y. Wang, "Graph Similarity Computation via Interpretable Neural Node Alignment," arXiv Preprint, Dec. 2024. https://arxiv.org/pdf/2412.12185 [Google Scholar]
- P. J. Kelly, "A congruence theorem for trees," Pacific J. Math., vol. 7, no. 1, pp. 961968, 1957. [Google Scholar]
- R. Hammack, W. Imrich, and S. Klavzar, Handbook of Product Graphs, 2nd ed. Boca Raton, FL, USA: CRC Press, 2011. https://doi.org/10.1201/b10959 [Google Scholar]
- R. M. Karp, "Reducibility among combinatorial problems," in Complexity of Computer Computations, R. E. Miller and J. W. Thatcher, Eds. New York, NY, USA: Plenum Press, pp. 85-103, 1972. [Google Scholar]
- M. Göös, N. Harms, V Imbach, and D. Sokolov, "Sign-Rank of k-Hamming Distance is Constant," arXiv Preprint, May 2025. 10.48550/arXiv.2506.12022 [Google Scholar]
- R. W. Hamming, "Error detecting and error correcting codes," Bell Syst. Tech. J., vol. 29, no. 2, pp. 147-160, Apr. 1950. [Google Scholar]
- S. Grohe, G. Rattan, and G. J. Woeginger, "Graph Similarity and Approximate Isomorphism," in MFCS, LIPIcs, vol. 117, 2018. [Google Scholar]
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.