数据加载中.....
|
jsp.display-item.identifier=請使用永久網址來引用或連結此文件:
http://ir.lib.ncu.edu.tw/handle/987654321/27964
|
题名: | The minimum number of e-vertex-covers among hypergraphs with e edges of given ranks |
作者: | Chang,FH;Fu,HL;Hwang,FK;Lin,BC |
贡献者: | 數學研究所 |
日期: | 2009 |
上传时间: | 2010-06-29 19:39:03 (UTC+8) |
出版者: | 中央大學 |
摘要: | We study the problem that among all hypergraphs with e edges of ranks l(1), ..., l(e) an v vertices, which hypergraph has the least number of vertex-covers of size e. The problem is very difficult and we only get some partial answers. We show an application of our results to improve the error-tolerance of a pooling design proposed in the literature. (c) 2008 Elsevier B.V. All rights reserved. |
關聯: | DISCRETE APPLIED MATHEMATICS |
显示于类别: | [數學研究所] 期刊論文
|
文件中的档案:
档案 |
描述 |
大小 | 格式 | 浏览次数 |
index.html | | 0Kb | HTML | 546 | 检视/开启 |
|
在NCUIR中所有的数据项都受到原著作权保护.
|