2450 search results - page 4 / 490 » Time Mapping with Hypergraphs |
89
Voted
GECCO
2004
Springer
15 years 5 months ago
2004
Springer
This paper presents a study of different models for the growth curves and takeover time in a distributed EA (dEA). The calculation of the takeover time and the dynamical growth cu...
85
Voted
WG
2005
Springer
15 years 5 months ago
2005
Springer
We review the concepts of hypertree decomposition and hypertree width from a graph theoretical perspective and report on a number of recent results related to these concepts. We al...
182
Voted
DMTCS
2011
13 years 11 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).
COMBINATORICS
2000
14 years 11 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...
86
Voted
IPL
2006
14 years 11 months ago
2006
We study the problem of embedding a directed hypergraph on a ring that has applications in optical network communications. The undirected version (MCHEC) has been extensively stud...