1208 search results - page 19 / 242 » On Counting Generalized Colorings |
SODA
2007
ACM
13 years 9 months ago
2007
ACM
We introduce a general method to count and randomly sample unlabeled combinatorial structures. The approach is based on pointing unlabeled structures in an “unbiased” way, i.e...
RSA
2006
13 years 7 months ago
2006
We analyze Markov chains for generating a random k-coloring of a random graph Gn,d/n. When the average degree d is constant, a random graph has maximum degree (log n/ log log n), ...
COLOGNETWENTE
2009
13 years 9 months ago
2009
We consider maximum properly edge-colored trees in edge-colored graphs Gc . We also consider the problem where, given a vertex r, determine whether the graph has a spanning tree r...
TIP
2010
13 years 2 months ago
2010
We propose the concept of a generalized assorted pixel (GAP) camera, which enables the user to capture a single image of a scene and, after the fact, control the tradeoff between s...
DMTCS
2008
13 years 6 months ago
2008
Recently, Kitaev and Remmel [8] refined the well-known permutation statistic "descent" by fixing parity of one of the descent's numbers. Results in [8] were extende...