Newsgroups: comp.constraints
Path: cantaloupe.srv.cs.cmu.edu!das-news2.harvard.edu!news2.near.net!news.mathworks.com!udel!gatech!howland.reston.ans.net!Germany.EU.net!Munich.Germany.EU.net!ecrc!acrab60!thom
From: thom@ecrc.de (Thom Fruehwirth)
Subject: Re: Graph Matching with Finite Domains?
Message-ID: <D2pBFp.D2n@ecrc.de>
Sender: news@ecrc.de
Reply-To: thom@ecrc.de
Organization: European Computer-Industry Research Centre GmbH.
References: <3fj98j$r61@olymp.informatik.uni-bonn.de>
Date: Fri, 20 Jan 1995 11:19:00 GMT
Lines: 21

tk@francium.informatik.uni-bonn.de (Thomas Kolbe) wrote on Jan 18:
>I'm currently working on the graph matching problem

A trivial solution not using constraints is to assert
all edge-relations of the bigger graph:

edge(a,b).
edge(b,c).
..

and to ask the subgraph as query:

edge(X,Y),edge(Y,Z),edge(Z,X).

To improve on that you could use generalised propagation
as implemented in Eclipse. That should be the easiest 
and rather efficient solution to your problem.

thom


