1632 search results - page 34 / 327 » On special numberings of hypergraphs |
150
click to vote
CPC
2007
15 years 6 months ago
2007
Let G be a graph with no three independent vertices. How many edges of G can be packed with edge-disjoint copies of Kk? More specifically, let fk(n, m) be the largest integer t s...
268
click to vote
ICDE
2003
IEEE
16 years 7 months ago
2003
IEEE
Determining relationships such as functional or inclusion dependencies within and across databases is important for many applications in information integration. When such informa...
161
click to vote
ENTCS
2008
15 years 6 months ago
2008
The satisfiability problem is the fundamental problem in proving the conflict-freeness of specifications, or in finding a counterexample for an invalid statement. In this paper, w...
185
click to vote
JGT
2010
15 years 4 months ago
2010
Let G(V, E) be a simple, undirected graph where V is the set of vertices and E is the set of edges. A b-dimensional cube is a Cartesian product I1 × I2 × · · · × Ib, where ea...
210
click to vote
ESA
2003
Springer
15 years 11 months ago
2003
Springer
We prove that various geometric covering problems, related to the Travelling Salesman Problem cannot be efficiently approximated to within any constant factor unless P = NP. This ...