知识卡片
团是两两相邻的顶点集合
无向图中的团是一个顶点子集,其中任意两个不同顶点都有边相连,即完全子图。
团大小是顶点数;最大团是优化问题,问是否有大小k的团则是判定问题,二者不能混为一谈。
这张卡片看不懂?
这张卡片的反馈已满 10 条,暂时无法继续提交。
已有反馈 · 0 / 10 条
还没有人提交反馈。
在整书笔记中的位置
原书出处 · 1 处
- 第34章 NP完全性 · 查看原书依据
A clique in an undirected graph G = (V, E) is a subset V′ ⊆ V of vertices, each pair of which is connected by an edge in E. In other words, a clique is a complete subgraph of G. The size of a clique is the number of vertices it contains. The clique problem is the optimization problem of finding a clique of maximum size in a graph. The
参考来源
- 位置:《算法导论(第4版)》第34章《NP完全性》(OEBPS/chapter034.xhtml,文本字符[80000,85000))。
- 结论依据:原文§34.4–34.5的3-CNF、团、顶点覆盖和哈密顿环归约;图已核对,跨单元证明留待续读。
- 原始内容:A clique in an undirected graph G = ( V , E ) is a subset V ′ ⊆ V of vertices, each pair of which is connected by an edge in E . In other words, a clique is a complete subgraph of G . The size of a clique is the number of vertices it contains. The clique problem is the optimization problem of finding a clique of maximum size in a graph. The