23 search results - page 1 / 5 » Hypergraphs and Degrees of Parallelism: A Completeness Resul... |
FOSSACS
2004
Springer
14 years 4 months ago
2004
Springer
Abstract. In order to study relative PCF-definability of boolean functions, we associate a hypergraph Hf to any boolean function f (following [3, 5]). We introduce the notion of t...
JPDC
2000
13 years 10 months ago
2000
A new class of interconnection networks, the hypernetworks, has been proposed recently. Hypernetworks are characterized by hypergraphs. Compared with point-to-point networks, they...
IPPS
2010
IEEE
13 years 8 months ago
2010
IEEE
This paper investigates scheduling loosely coupled task-bundles in highly heterogeneous distributed systems. Two allocation quality metrics are used in pay-per-service distributed ...
CORR
2010
Springer
13 years 11 months ago
2010
Springer
The overlap number of a finite (d + 1)-uniform hypergraph H is the largest constant c(H) (0, 1] such that no matter how we map the vertices of H into Rd , there is a point covered...
COMBINATORICS
1999
13 years 10 months ago
1999
It is proven that for every fixed h, a and b, a graph with n vertices and minimum degree at least h-1 h n, which contains no copy of Kb (the complete graph with b vertices), conta...