836 search results - page 133 / 168 » Orthogonal Colorings of Graphs |
144
Voted
VLSISP
2002
15 years 3 months ago
2002
Large-grain synchronous dataflow graphs or multi-rate graphs have the distinct feature that the nodes of the dataflow graph fire at different rates. Such multi-rate large-grain dat...
137
Voted
JCT
2010
15 years 2 months ago
2010
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...
161
Voted
SIAMDM
2010
14 years 10 months ago
2010
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...
107
Voted
CSCLP
2005
Springer
15 years 9 months ago
2005
Springer
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...
123
Voted
AC
2003
Springer
15 years 8 months ago
2003
Springer
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...