523 search results - page 35 / 105 » Decidability of string graphs |
100
click to vote
ICCS
2009
Springer
15 years 10 months ago
2009
Springer
This paper is an extended abstract of the talk given at ICCS’09. Rules have long been considered as an essential component of knowledge-based systems. We focus here on conceptual...
128
Voted
FSTTCS
2003
Springer
15 years 8 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...
118
Voted
STACS
2010
Springer
15 years 7 months ago
2010
Springer
We completely characterise the computational complexity of the list homomorphism problem for graphs in combinatorial and algebraic terms: for every graph H the problem is either N...
113
Voted
APWEB
2008
Springer
15 years 5 months ago
2008
Springer
The study of a national Web graph is challenging and can provide insight into social phenomena specific to a country. However, because there is no country border in the Web, decidi...
148
click to vote
ENTCS
2006
15 years 3 months ago
2006
A taxonomy of model transformations was introduced in [18]. Among others, such a taxonomy can help developers in deciding which language, forma lism, tool or mechanism is best sui...