1749 search results - page 146 / 350 » Conditional colorings of graphs |
193
click to vote
AAAI
2008
15 years 9 months ago
2008
The construction of causal graphs from non-experimental data rests on a set of constraints that the graph structure imposes on all probability distributions compatible with the gr...
139
click to vote
ICDT
2007
ACM
16 years 23 days ago
2007
ACM
We consider random graphs, and their extensions to random structures, with edge probabilities of the form βn−α , where n is the number of vertices, α, β are fixed and α >...
165
click to vote
FSTTCS
2003
Springer
15 years 11 months ago
2003
Springer
For monoids that satisfy a weak cancellation condition, it is shown that the decidability of the existential theory of word equations is preserved under graph products. Furthermore...
144
click to vote
ACSD
2006
IEEE
16 years 20 days ago
2006
IEEE
Signal Transition Graphs (STGs) are a popular formalism for the specification of asynchronous circuits. A necessary condition for the implementability of an STG is the existence ...
191
click to vote
ENTCS
2006
2006
Overview of Formal Concepts for Model Transformations Based on Typed Attributed Graph Transformation
15 years 6 months ago
In this paper we give an overview of formal concepts for model transformations between visual languages based on typed attributed graph transformation. We start with a basic conce...