Sciweavers

720 search results - page 114 / 144
» Nonrepetitive colorings of graphs
Sort
View
JCT
2010
79views more  JCT 2010»
13 years 6 months ago
Vertex-coloring edge-weightings: Towards the 1-2-3-conjecture
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
SIAMDM
2010
194views more  SIAMDM 2010»
13 years 2 months ago
Combinatorics and Geometry of Finite and Infinite Squaregraphs
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...
Hans-Jürgen Bandelt, Victor Chepoi, David Epp...
CSCLP
2005
Springer
14 years 1 months ago
A CSP Search Algorithm with Reduced Branching Factor
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...
Igor Razgon, Amnon Meisels
AC
2003
Springer
14 years 24 days ago
A Face Recognition System Based on Local Feature Characterization
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...
Paola Campadelli, Raffaella Lanzarotti
IJISTA
2008
164views more  IJISTA 2008»
13 years 7 months ago
Combining Time-Of-Flight depth and stereo images without accurate extrinsic calibration
: 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...
Uwe Hahne, Marc Alexa