The minimum number of e-vertex-covers among hypergraphs with e edges of given ranks

Full metadata record

DC Field	Value	Language
dc.contributor.author	Chang, F. H.	en_US
dc.contributor.author	Fu, H. L.	en_US
dc.contributor.author	Hwang, F. K.	en_US
dc.contributor.author	Lin, B. C.	en_US
dc.date.accessioned	2014-12-08T15:10:09Z	-
dc.date.available	2014-12-08T15:10:09Z	-
dc.date.issued	2009-01-06	en_US
dc.identifier.issn	0166-218X	en_US
dc.identifier.uri	http://dx.doi.org/10.1016/j.dam.2008.05.006	en_US
dc.identifier.uri	http://hdl.handle.net/11536/7757	-
dc.description.abstract	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.	en_US
dc.language.iso	en_US	en_US
dc.subject	Vertex-cover	en_US
dc.subject	Hypergraph	en_US
dc.subject	Pooling design	en_US
dc.title	The minimum number of e-vertex-covers among hypergraphs with e edges of given ranks	en_US
dc.type	Article	en_US
dc.identifier.doi	10.1016/j.dam.2008.05.006	en_US
dc.identifier.journal	DISCRETE APPLIED MATHEMATICS	en_US
dc.citation.volume	157	en_US
dc.citation.issue	1	en_US
dc.citation.spage	164	en_US
dc.citation.epage	169	en_US
dc.contributor.department	應用數學系	zh_TW
dc.contributor.department	Department of Applied Mathematics	en_US
dc.identifier.wosnumber	WOS:000261861700015	-
dc.citation.woscount	0	-
Appears in Collections:	Articles

Files in This Item:

If it is a zip file, please download the file and unzip it, then open index.html in a browser to view the full text content.