342 search results - page 18 / 69 » Constrained Integer Partitions |
JGT
2007
13 years 8 months ago
2007
: Let G be a graph with maximum degree d ≥ 3 and ω(G) ≤ d, where ω(G) is the clique number of the graph G. Let p1 and p2 be two positive integers such that d = p1 + p2. In th...
JCT
1998
13 years 8 months ago
1998
Let Q(N) denote the number of partitions of N into distinct parts. If ω(k) := 3k2 +k 2 , then it is well known that Q(N) + ∞X k=1 (−1)k “ Q(N − 2ω(k)) + Q(N − 2ω(−k)...
JCT
2006
13 years 8 months ago
2006
We prove that Rado's Boundedness Conjecture from Richard Rado's 1933 famous dissertation Studien zur Kombinatorik is true if it is true for homogeneous equations. We the...
HICSS
2003
IEEE
14 years 1 months ago
2003
IEEE
The hop constrained min-sum arborescence with outage costs problem consists of selecting links in a network so as to connect a set of terminal nodes N={2,3,……n} to a central n...
PDPTA
2004
13 years 9 months ago
2004
Abstract One of the goals envisioned by Grid computing is to make the execution of both computational and data-intensive problems possible. A key problem is finding the optimal set...