<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:content="http://purl.org/rss/1.0/modules/content/"><channel><title>Subgraph Matching on Jeanphilo Blog</title><link>https://shio-chan-dev.github.io/jeanblog/tags/subgraph-matching/</link><description>Recent content in Subgraph Matching on Jeanphilo Blog</description><generator>Hugo -- 0.159.2</generator><language>en-us</language><lastBuildDate>Mon, 09 Feb 2026 09:59:16 +0800</lastBuildDate><atom:link href="https://shio-chan-dev.github.io/jeanblog/tags/subgraph-matching/index.xml" rel="self" type="application/rss+xml"/><item><title>Subgraph Matching / Pattern Matching: VF2, Ullmann, and Engineering-Grade Pruning - ACERS Analysis</title><link>https://shio-chan-dev.github.io/jeanblog/dev/algorithm/graph/70-subgraph-matching-vf2-ullmann-and-pruning/</link><pubDate>Mon, 09 Feb 2026 09:59:16 +0800</pubDate><guid>https://shio-chan-dev.github.io/jeanblog/dev/algorithm/graph/70-subgraph-matching-vf2-ullmann-and-pruning/</guid><description>A systematic guide to Subgraph Isomorphism (NP-hard) and the core ideas of VF2/Ullmann, with emphasis on engineering reality: constrained pattern queries and candidate pruning usually matter more than the algorithm name itself.</description></item></channel></rss>