Ring Based Approximation of Graph Edit Distance
Author:
Publisher
Springer International Publishing
Link
http://link.springer.com/content/pdf/10.1007/978-3-319-97785-0_28
Reference18 articles.
1. Abu-Aisheh, Z., Gaüzere, B., Bougleux, S., Ramel, J.Y., Brun, L., Raveaux, R., Héroux, P., Adam, S.: Graph edit distance contest 2016: results and future challenges. Pattern Recogn. Lett. 100, 96–103 (2017). https://doi.org/10.1016/j.patrec.2017.10.007
2. Blumenthal, D.B., Gamper, J.: Improved lower bounds for graph edit distance. IEEE Trans. Knowl. Data Eng. 30(3), 503–516 (2018). https://doi.org/10.1109/TKDE.2017.2772243
3. Blumenthal, D.B., Gamper, J.: On the exact computation of the graph edit distance. Pattern Recogn. Lett. (2018). https://doi.org/10.1016/j.patrec.2018.05.002
4. Bougleux, S., Brun, L., Carletti, V., Foggia, P., Gaüzère, B., Vento, M.: Graph edit distance as a quadratic assignment problem. Pattern Recogn. Lett. 87, 38–46 (2017). https://doi.org/10.1016/j.patrec.2016.10.001
5. Bougleux, S., Gaüzère, B., Blumenthal, D.B., Brun, L.: Fast linear sum assignment with error-correction and no cost constraints. Pattern Recogn. Lett. (2018). https://doi.org/10.1016/j.patrec.2018.03.032
Cited by 7 articles. 订阅此论文施引文献 订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. NodeGit : Diffing and Merging Node Graphs;ACM Transactions on Graphics;2023-12-05
2. Enumerating dissimilar minimum cost perfect and error-correcting bipartite matchings for robust data matching;Information Sciences;2022-06
3. Upper Bounding Graph Edit Distance Based on Rings and Machine Learning;International Journal of Pattern Recognition and Artificial Intelligence;2021-04-07
4. Improved local search for graph edit distance;Pattern Recognition Letters;2020-01
5. Fast Similarity Search for Graphs by Edit Distance;Cybernetics and Systems Analysis;2019-11
1.学者识别学者识别
2.学术分析学术分析
3.人才评估人才评估
"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370
www.globalauthorid.com
TOP
Copyright © 2019-2024 北京同舟云网络信息技术有限公司 京公网安备11010802033243号 京ICP备18003416号-3