778 search results - page 58 / 156 » Expressiveness and complexity of graph logic |
118
Voted
CORR
2010
Springer
14 years 10 months ago
2010
Springer
Schaefer's theorem is a complexity classification result for so-called Boolean constraint satisfaction problems: it states that every Boolean constraint satisfaction problem ...
100
Voted
BMCBI
2008
15 years 20 days ago
2008
Background: High-throughput methods that allow for measuring the expression of thousands of genes or proteins simultaneously have opened new avenues for studying biochemical proce...
79
Voted
FLAIRS
2008
15 years 2 months ago
2008
For many educational applications such as learning tools for argumentation, structured diagrams are a suitable form of external representation. However, student-created graphs pos...
132
click to vote
ICDE
2010
IEEE
16 years 9 days ago
2010
IEEE
Abstract-- This demonstration presents an interactive provenance browser for visualizing and querying data dependency (lineage) graphs produced by scientific workflow runs. The bro...
123
click to vote
AGTIVE
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. Since the systematic evolution of graph-like program models has become important in software engineering, graph transformation has gained much attention in this area. For...