1749 search results - page 181 / 350 » Conditional colorings of graphs |
185
click to vote
VLSISP
2002
15 years 6 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...
201
click to vote
JCT
2010
15 years 5 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...
213
click to vote
SIAMDM
2010
15 years 1 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...
186
click to vote
ICDM
2007
IEEE
15 years 10 months ago
2007
IEEE
This paper addresses the task of change analysis of correlated multi-sensor systems. The goal of change analysis is to compute the anomaly score of each sensor when we know that t...
162
click to vote
ENTCS
2007
15 years 6 months ago
2007
Reasoning about graph and model transformation systems is an important means to underpin model-driven software engineering, such as Model-Driven Architecture (MDA) and Model Integ...