Graph matching

<h2 id="see-also">See also</h2>
<ul><li><a href="/facts/String_matching/RCvwDRle">String matching</a></li>
<li><a href="/facts/Pattern_matching/CEwptMs9">Pattern matching</a></li></ul>

Wikimedia Commons has media related to matching.

<h2 id="references">References</h2>

<ol>
<li id="fn:1"><p>Endika Bengoetxea, "Inexact Graph Matching Using Estimation of Distribution Algorithms" Archived 2017-01-11 at the Wayback Machine, Ph.
 D., 2002, Chapter 2:The graph matching problem Archived 2017-05-16 at the Wayback Machine (retrieved June 28, 2017) <a href="http://www.sc.ehu.es/acwbecae/ikerkuntza/these/" target="_blank">http://www.sc.ehu.es/acwbecae/ikerkuntza/these/</a> <a href="#fnref:1" class="footnote-back-ref">↩</a></p></li>
<li id="fn:2"><p>Endika Bengoetxea, Ph.D., Abstract Archived 2017-01-11 at the Wayback Machine <a href="http://www.sc.ehu.es/acwbecae/ikerkuntza/these/" target="_blank">http://www.sc.ehu.es/acwbecae/ikerkuntza/these/</a> <a href="#fnref:2" class="footnote-back-ref">↩</a></p></li>
<li id="fn:3"><p>Endika Bengoetxea, "Inexact Graph Matching Using Estimation of Distribution Algorithms" Archived 2017-01-11 at the Wayback Machine, Ph.
 D., 2002, Chapter 2:The graph matching problem Archived 2017-05-16 at the Wayback Machine (retrieved June 28, 2017) <a href="http://www.sc.ehu.es/acwbecae/ikerkuntza/these/" target="_blank">http://www.sc.ehu.es/acwbecae/ikerkuntza/these/</a> <a href="#fnref:3" class="footnote-back-ref">↩</a></p></li>
<li id="fn:4"><p>Endika Bengoetxea, "Inexact Graph Matching Using Estimation of Distribution Algorithms" Archived 2017-01-11 at the Wayback Machine, Ph.
 D., 2002, Chapter 2:The graph matching problem Archived 2017-05-16 at the Wayback Machine (retrieved June 28, 2017) <a href="http://www.sc.ehu.es/acwbecae/ikerkuntza/these/" target="_blank">http://www.sc.ehu.es/acwbecae/ikerkuntza/these/</a> <a href="#fnref:4" class="footnote-back-ref">↩</a></p></li>
<li id="fn:5"><p>Graph-Based Methods in Computer Vision: Developments and Applications, p. 58 <a href="https://books.google.com/books?id=V66eBQAAQBAJ&pg=PA58" target="_blank">https://books.google.com/books?id=V66eBQAAQBAJ&pg=PA58</a> <a href="#fnref:5" class="footnote-back-ref">↩</a></p></li>
<li id="fn:6"><p>Neuhaus, Michel; Bunke, Horst (2007). Bridging the Gap Between Graph Edit Distance and Kernel Machines. World Scientific. p. 16. doi:10.1142/6523. ISBN 978-981-270-817-5. Archived from the original on 30 December 2022. Retrieved 30 December 2022. <a href="978-981-270-817-5" target="_blank">978-981-270-817-5</a> <a href="#fnref:6" class="footnote-back-ref">↩</a></p></li>
<li id="fn:7"><p>Horst Bunke, Xiaoyi Jang, "Graph Matching and Similarity", in: Intelligent Systems and Interfaces, pp. 281-304 (2000) doi:10.1007/978-1-4615-4401-2_10 <a href="/wiki/Doi_(identifier)" target="_blank">/wiki/Doi_(identifier)</a> <a href="#fnref:7" class="footnote-back-ref">↩</a></p></li>
<li id="fn:8"><p>Horst Bunke, Xiaoyi Jang, "Graph Matching and Similarity", in: Intelligent Systems and Interfaces, pp. 281-304 (2000) doi:10.1007/978-1-4615-4401-2_10 <a href="/wiki/Doi_(identifier)" target="_blank">/wiki/Doi_(identifier)</a> <a href="#fnref:8" class="footnote-back-ref">↩</a></p></li>
</ol>

Graph matching open-in-new

Graph matching