1188 search results - page 40 / 238 » Extended Graph Unification |
CSR
2008
Springer
13 years 11 months ago
2008
Springer
A function f of a graph is called a complete graph invariant if two given graphs G and H are isomorphic exactly when f(G) = f(H). If additionally, f(G) is a graph isomorphic to G, ...
CSCLP
2007
Springer
14 years 4 months ago
2007
Springer
Abstract. Graph pattern matching is a central application in many fields. In various areas, the structure of the pattern can only be approximated and exact matching is then too ac...
ICC
2007
IEEE
14 years 4 months ago
2007
IEEE
Abstract— In this contribution the radio channel model proposed in [1] is extended to include multiple transmitters and receivers. The propagation environment is modelled using r...
ILP
2003
Springer
14 years 3 months ago
2003
Springer
In this paper, we investigate condensation of a clause. First, we extend a substitution graph introduced by Scheffer et al. (1996) to a total matcher graph. Then, we give a correc...
IWPC
2002
IEEE
14 years 2 months ago
2002
IEEE
Program slicing has many applications in software engineering activities including program comprehension, debugging, testing, maintenance, and model checking. In this paper, we pr...