223 search results - page 22 / 45 » A Note on Graph Pebbling |
DM
1998
13 years 7 months ago
1998
An embedding of Kn into a hypercube is a mapping of the n vertices of Kn to distinct vertices of the hypercube, and the associated cost is the sum over all pairs of (mapped) verti...
CORR
2011
Springer
12 years 11 months ago
2011
Springer
Efficient implementations of DPLL with the addition of clause learning are the fastest complete Boolean satisfiability solvers and can handle many significant real-world problem...
SIAMDM
1998
13 years 7 months ago
1998
The richest class of t-perfect graphs known so far consists of the graphs with no so-called odd-K4. Clearly, these graphs have the special property that they are hereditary t-perfe...
ENDM
2008
13 years 7 months ago
2008
In this note we report on our recent work, still in progress, regarding Folkman numbers. Let f(2, 3, 4) denote the smallest integer n such that there exists a K4
291
click to vote
Lecture Notes
Easy and neat set of lecture notes in Medical Image Analysis taught at West Virginia University by Prof. Tim McGraw. It covers several famous computer vision techniques such as act...