241 search results - page 11 / 49 » Graphs, Hypergraphs and Hashing |
202
click to vote
DMTCS
2011
14 years 1 months ago
2011
Abstract. We present an algorithm that for 2-colorable 3-uniform hypergraphs, finds a 2-coloring in average running time O(n5 log2 n).
116
Voted
COMBINATORICS
2000
15 years 1 months ago
2000
A mixed hypergraph is a triple H = (V, C, D) where V is the vertex set and C and D are families of subsets of V , the C-edges and D-edges, respectively. A k-colouring of H is a ma...
121
click to vote
ACSC
2005
IEEE
15 years 7 months ago
2005
IEEE
The global dynamics of automata networks (such as neural networks) are a function of their topology and the choice of automata used. Evolutionary methods can be applied to the opt...
126
Voted
ESA
2006
Springer
15 years 5 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 ...
130
click to vote
CVPR
2008
IEEE
16 years 3 months ago
2008
IEEE
We consider the problem of finding a matching between two sets of features, given complex relations among them, going beyond pairwise. Each feature set is modeled by a hypergraph ...