| 连通区域的最优分割与最优染色分割 |
| |
| 引用本文： | 刘凯峰,钟志华.连通区域的最优分割与最优染色分割[J].数学的实践与认识,2011,41(17). |
| |
| 作者姓名： | 刘凯峰 钟志华 |
| |
| 作者单位： | 南通大学理学院,江苏南通,226007 |
| |
| 摘 要： | Ψ(∑,n)和θ(Σ,n)分别表示连通区域∑的n-分割最优值和n-染色分割最优值,记g(Σ,n)=(Ψ(Σ,n))/(θ(Σ,n)).对于由某些连通区域构成的连通区域集(?),记g(θ,n)=sup{g(Σ,n)}.证明:若θ_1为连通凸区域集,则g(θ_1,3)≥3/2.∑∈θ
|
| 关 键 词： | 连通区域 最优分割 最优染色分割 |
On The Best Cut and Best Dyeing Cut of the Connected Region |
| |
| LIU Kai-feng,ZHONG Zhi-hua.On The Best Cut and Best Dyeing Cut of the Connected Region[J].Mathematics in Practice and Theory,2011,41(17). |
| |
| Authors: | LIU Kai-feng ZHONG Zhi-hua |
| |
| Institution: | LIU Kai-feng,ZHONG Zhi-hua (School of Science,Nantong University,Nantong 226007,China) |
| |
| Abstract: | Let Ψ(Σ,n) be the value of best n-cut of Σ and θ(Σ,n) be the value of best Dyeing n-cut of Σ,where Σ is a connected region.Define g(Σ,n) as the ratio Ψ(Σ,n) to θ(Σ,n).Let g(θ,n) =sup{g(Σ,n)},where θ is set of the connected regions.In this paperseewe prove that if θ_1 is a set of the connected convex regions than g(θ_1,3)≥3/2. |
| |
| Keywords: | connected region best cut best dyeing cut |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
