<?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>Ullmann on Jeanphilo Blog</title><link>https://shio-chan-dev.github.io/jeanblog/zh/tags/ullmann/</link><description>Recent content in Ullmann on Jeanphilo Blog</description><generator>Hugo -- 0.159.2</generator><language>zh-cn</language><lastBuildDate>Mon, 09 Feb 2026 09:59:16 +0800</lastBuildDate><atom:link href="https://shio-chan-dev.github.io/jeanblog/zh/tags/ullmann/index.xml" rel="self" type="application/rss+xml"/><item><title>子图匹配 / 模式匹配：VF2 与 Ullmann 的工程化剪枝 ACERS 解析</title><link>https://shio-chan-dev.github.io/jeanblog/zh/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/zh/dev/algorithm/graph/70-subgraph-matching-vf2-ullmann-and-pruning/</guid><description>系统讲解 Subgraph Isomorphism（NP-hard）与 VF2/Ullmann 核心思想，重点强调工程现实：受限模式查询与候选剪枝通常比算法名称本身更重要。</description></item></channel></rss>