Title:
zuixiaoquandingdianfugai
Download
Description: Empowering given a undirected graph G = (V, E), each point v ∈ U has a weight w (v). If the UV, and for any (u, v) ∈ E there is u ∈ U or v ∈ U, on U that map G to a fixed-point coverage. G the right to the minimum vertex cover is contained in G refers to the right vertex of the vertex cover and minimum.
To Search:
File list (Check if you may need any files):
20060830113 宋溪 最小权顶点覆盖问题
...................................\zuixiaoquan.cpp
...................................\zuixiaoquan.exe
...................................\最小权顶点覆盖问题.doc
