Abstract. A weighting of the edges of a graph is called vertexcoloring if the weighted degrees of the vertices yield a proper coloring of the graph. In this paper we show that such...
Maciej Kalkowski, Michal Karonski, Florian Pfender
Abstract. Squaregraphs were originally defined as finite plane graphs in which all inner faces are quadrilaterals (i.e., 4-cycles) and all inner vertices (i.e., the vertices not in...
This paper presents an attempt to construct a ”practical” CSP algorithm that assigns a variable with 2 values at every step. Such a strategy has been successfully used for cons...
A completely automatic face recognition system is presented. The method works on color and gray level images: after having localized the face and the facial features, it determines...
: We combine a low resolution time-of-flight depth image camera based on photonic mixer devices with two standard cameras in a stereo configuration. We show that this approach is u...