4066 search results - page 56 / 814 » Almost Complete Sets |
159
click to vote
GD
2004
Springer
16 years 1 days ago
2004
Springer
Consider the following question: does every complete geometric graph K2n have a partition of its edge set into n plane spanning trees? We approach this problem from three directio...
177
click to vote
COMBINATORICA
2007
15 years 6 months ago
2007
A complete partition of a graph G is a partition of its vertex set in which any two distinct classes are connected by an edge. Let cp(G) denote the maximum number of classes in a ...
153
click to vote
CACM
2008
15 years 5 months ago
2008
What can you do with a million images? In this paper we present a new image completion algorithm powered by a huge database of photographs gathered from the Web. The algorithm pat...
197
click to vote
RTA
1995
Springer
15 years 10 months ago
1995
Springer
We present a completion procedure (called MKB) that works for multiple reduction orderings. Given equations and a set of reduction orderings, the procedure simulates a computation ...
169
click to vote
EAAI
2008
15 years 6 months ago
2008
The criterion of total weighted completion time occurs as a sub-problem of combinatorial optimization problems in such diverse areas as scheduling, container loading and storage a...