1208 search results - page 58 / 242 » On Counting Generalized Colorings |
COMPGEOM
1999
ACM
14 years 1 months ago
1999
ACM
We define the path of a pseudo-triangulation, a data structure generalizing the path of a triangulation of a point set. This structure allows us to use divide-andconquer type of ...
WSCG
2004
13 years 10 months ago
2004
In this paper we describe a robust and efficient procedure to detect skin region with homogeneous color values in monocular indoor images. The mathematical background is a functio...
DAM
2006
13 years 9 months ago
2006
We observe that a formula given by S. Negami [Trans. Amer. Math. Soc. 299 (1987), 601-622] for the Tutte polynomial of a k-sum of two graphs generalizes to a colored Tutte polynom...
AUTONOMICS
2008
ACM
13 years 11 months ago
2008
ACM
Inspired by the collective foraging behavior of specific ant species, ant-based routing algorithms are able to find optimal or near optimal packet routes for Wireless Mesh Network...
ISAAC
2005
Springer
14 years 2 months ago
2005
Springer
We present an expected polynomial time algorithm to generate a 2-connected unlabeled planar graph uniformly at random. To do this we first derive recurrence formulas to count the ...