1632 search results - page 8 / 327 » On special numberings of hypergraphs |
MOC
2002
14 years 9 months ago
2002
160
Voted
SIGMOD
2005
ACM
15 years 9 months ago
2005
ACM
We review the notion of hypertree width, a measure of the degree of cyclicity of hypergraphs that is useful for identifying and solving efficiently easy instances of hard problems...
COMBINATORICA
2010
14 years 7 months ago
2010
For each k 2, let k (0, 1) be the largest number such that there exist k-uniform hypergraphs on n vertices with independent neighborhoods and (k + o(1)) n k edges as n . We pro...
DM
2010
14 years 9 months ago
2010
We say that a hypergraph H is hamiltonian path (cycle) saturated if H does not contain an open (closed) hamiltonian chain but by adding any new edge we create an open (closed) ham...
80
Voted
PARA
1995
Springer
15 years 1 months ago
1995
Springer
Coarse grain parallelism inherent in the solution of Linear Programming (LP) problems with block angular constraint matrices has been exploited in recent research works. However, t...