G. Valiente and C. Mart inez. An algorithm for graph pattern-matching. In Proceedings of the Fourth South American Workshop on String Processing, pages 180-- 197. Carleton University Press, 1997. 54  Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Appligraph: Applications of Graph Transformation - First.. - Kreowski, Plump, (eds.) (1998) (Correct)
....each message in an actor configuration determines a subgraph to be rewritten, the pattern matching needed for the production applications is trivial, and the concurrent interpretation can in principle be 12 very fast. A different group of researchers related to the Bremen group presented in [VM97] an algorithm for graph matching. It reduces the problem of finding a homomorphic image of a pattern graph in a target graph to that of finding homomorphic images of every connected component of the pattern in the target. For every connected component, the algorithm performs a combinatorial search ....
Gabriel Valiente and Conrado Mart'inez. An algorithm for graph pattern-matching. In Proc. 4th South American Workshop on String Processing, volume 8 of International Informatics Series, pages 180--197. Carleton University Press, 1997.
Grammatica: An Implementation of Algebraic Graph Transformation.. - Valiente Self-citation (Valiente) (Correct)
....l : K # L and m : L # G and a pushout (H, m # : R # H, r # : D # H) of r : K # R and d : K # D. 2 Graph Matching Grammatica includes a simple graph matching algorithm, which essentially consists of enumerating the leaves of a search tree and testing them for graph homomorphism; cf. [10]. A graph homomorphism m : L # G from a graph L with n nodes to a graph G with m nodes is represented by a Boolean n m matrix having exactly one true (one) in each row. A random leaf of the search tree is generated by finding the n base integer digits in (n to the power of) each m base integer ....
G. Valiente and C. Martnez. An algorithm for graph pattern-matching. In Proc. 4th South American Workshop on String Processing, volume 8 of International Informatics Series, pages 180--197. Carleton University Press, 1997.
A Relational View of Subgraph Isomorphism - Cortadella, Valiente Self-citation (Valiente) (Correct)
....an isomorphic image of a given graph, called the pattern, in another graph, called the target. The name of this problem comes from the image of the pattern being then a subgraph of the target. Graph homomorphisms are structure preserving relations over the relations associated to the graphs [17, 22, 23]. In particular, a structure preserving relation between the sets of vertices of two graphs is a subgraph isomorphism if it is injective. Let I denote the identity relation. Definition 2. A relation # # V # V is an isomorphism of a graph G # = V # , E # ) into a graph G = V, E) if # T # ....
G. Valiente and C. Martnez. An algorithm for graph pattern-matching. In Proc. 4th South American Workshop on String Processing, volume 8 of Int. Informatics Series, pages 180--197. Carleton University Press, 1997.
Applications of Graph Probing to Web Document Analysis - Lopresti, Wilfong (2001) (Correct)
No context found.
G. Valiente and C. Mart inez. An algorithm for graph pattern-matching. In Proceedings of the Fourth South American Workshop on String Processing, pages 180-- 197. Carleton University Press, 1997. 54
A Multi-paradigm Querying Approach for a Generic Multimedia .. - Wen, Li, Ma, Zhang (2002) (Correct)
No context found.
Martnez, C. and Valiente, G. An Algorithm for Graph Pattern-Matching. In Proc. Fourth South American Workshop on String Processing, volume 8 of International Informatics Series, Carleton University Press (1997), pp. 180-197.
Appligraph: Applications of Graph Transformation - Final Report - Kreowski, (eds.) (2002) (Correct)
No context found.
Gabriel Valiente and Conrado Martnez. An algorithm for graph pattern-matching. In Proc. 4th South American Workshop on String Processing, volume 8 of International Informatics Series, pages 180-197. Carleton University Press, 1997. 97
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC