Given a graph G constructed from a two-dimensional n-by-n grid, what is the number of spanning trees of G?
p e a r
a p p l e
l e m o n
+ b a n a n a
= o r a n g e
Consider a 13x13 checkerboard. It can be partitioned into a collection of
smaller square checkerboards in various ways. For example into 169 1x1
checkerboards or into 1 12x12 and 25 ...
An airplane has n seats, and all of them have been sold for a particular flight, with no overbooking. When the last passenger arrives, he finds that his seat is ...
you have a truck that is moving around a circular track with gas stations spaced out at some distance between them. Each station has a finite amount of gas, the ...
Computer Architecture, Fifth Edition: A Quantitative Approach (The Morgan Kaufmann ...
by John L. Hennessy
Art of Computer Programming, Volume 1: Fundamental Algorithms (3rd Edition)
by Donald E. Knuth
The Elements of Statistical Learning
by T. Hastie
Computational Geometry: Algorithms and Applications
by Mark de Berg
Reading Between the Numbers: Statistical Thinking in Everyday Life
by Joseph Tal