32 search results - page 1 / 7 » On Feasible Sets of Mixed Hypergraphs |
74
Voted
COMBINATORICS
2004
15 years 12 days ago
2004
117
Voted
GC
2002
Springer
15 years 10 days ago
2002
Springer
A mixed hypergraph is a triple H = (X, C, D), where X is the vertex set, and each of C, D is a list of subsets of X. A strict k-coloring of H is a surjection c : X {1, . . . , k}...
FCT
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. We analyse the mixing time of Markov chains using path coupling with stopping times. We apply this approach to two hypergraph problems. We show that the Glauber dynamics ...
97
Voted
COMBINATORICS
2000
15 years 11 days 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...
MP
2002
15 years 6 days ago
2002
Semismooth Newton methods constitute a major research area for solving mixed complementarity problems (MCPs). Early research on semismooth Newton methods is mainly on infeasible me...