778 search results - page 27 / 156 » Expressiveness and complexity of graph logic |
88
Voted
ICCAD
2004
IEEE
15 years 9 months ago
2004
IEEE
Polynomial expressions are used to compute a wide variety of mathematical functions commonly found in signal processing and graphics applications, which provide good opportunities...
117
click to vote
FSTTCS
2010
Springer
14 years 10 months ago
2010
Springer
This paper focuses on first-order logic (FO) extended by reachability predicates such that the expressiveness and hence decidability properties lie between FO and monadic second-o...
110
Voted
JCP
2006
15 years 13 days ago
2006
Finding a maximum cardinality matching in a graph is a problem appearing in numerous settings. The problem asks for a set of edges of maximum cardinality, such that no two edges of...
104
Voted
CONSTRAINTS
1998
15 years 4 days ago
1998
Graphs are widely used for information visualization purposes, since they provide a natural and intuitive tation of complex abstract structures. The automatic generation of drawing...
94
Voted
MFCS
1997
Springer
15 years 4 months ago
1997
Springer
The aim of this paper is an integration of graph grammars with different kinds of behavioural constraints, in particular with temporal logic constraints. Since the usual algebraic ...