SIAMDM
2008
13 years 11 months ago
2008
SIAMDM
2008
13 years 11 months ago
2008
Hat problems have become a popular topic in recreational mathematics. In a typical hat problem, each of n players tries to guess the color of the hat they are wearing by looking a...
SIAMDM
2008
13 years 11 months ago
2008
For a rooted graph G, let EV (G; p) be the expected number of vertices reachable from the root when each edge has an independent probability p of operating successfully. We examine...
SIAMDM
2008
13 years 11 months ago
2008
In this paper we consider the problem of testing whether a graph is triangle-free, and more generally, whether it is H-free, for a fixed subgraph H. The algorithm should accept gr...
SIAMDM
2008
13 years 11 months ago
2008
SIAMDM
2008
13 years 11 months ago
2008
The first-fit chromatic number of a graph is the number of colors needed in the worst case of a greedy coloring. It is also called the Grundy number, which is defined to be the max...
SIAMDM
2008
13 years 11 months ago
2008