1632 search results - page 10 / 327 » On special numberings of hypergraphs |
STOC
2006
ACM
15 years 9 months ago
2006
ACM
We consider the problem of randomness extraction from independent sources. We construct an extractor that can extract from a constant number of independent sources of length n, ea...
IMCSIT
2010
14 years 7 months ago
2010
This paper presents a system for segmentation of images into regions and annotation of these regions for semantic identification of the objects present in the image. The unified me...
95
Voted
ESA
2006
Springer
15 years 1 months ago
2006
Springer
We show that enumerating all minimal spanning and connected subsets of a given matroid is quasi-polynomially equivalent to the well-known hypergraph transversal problem, and thus ...
SODA
2010
ACM
15 years 7 months ago
2010
ACM
The hypergraph matching problem is to find a largest collection of disjoint hyperedges in a hypergraph. This is a well-studied problem in combinatorial optimization and graph theo...
COMBINATORICA
2007
14 years 9 months ago
2007
The main result of this paper is that every 4-uniform hypergraph on n vertices and m edges has a transversal with no more than (5n + 4m)/21 vertices. In the particular case n = m,...