1208 search results - page 3 / 242 » Uniform eventown problems |
125
Voted
FCT
2005
Springer
15 years 10 months ago
2005
Springer
99
Voted
ECCC
2006
15 years 5 months ago
2006
136
click to vote
DM
2010
15 years 5 months ago
2010
Using a generalisation of Hamiltonian cycles to uniform hypergraphs due to Katona and Kierstead, we define a new notion of a Hamiltonian decomposition of a uniform hypergraph. We ...
165
Voted
STOC
2010
ACM
15 years 10 months ago
2010
ACM
There has been much progress on geometric set cover problems, but most known techniques only apply to the unweighted setting. For the weighted setting, very few results are known ...
160
click to vote
WG
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. Assume that each vertex of a graph G is assigned a nonnegative integer weight and that l and u are nonnegative integers. One wish to partition G into connected components...