Path: utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!usc!prospero.usc.edu!venkat
From: venkat@prospero.usc.edu (Venkat Venkateswar)
Newsgroups: comp.ai
Subject: WANTED : References on Graph/Semantic_Net  Matching
Message-ID: <27592@usc.edu>
Date: 18 Oct 90 00:04:59 GMT
Sender: news@usc.edu
Organization: University of Southern California, Los Angeles, CA
Lines: 8
Nntp-Posting-Host: prospero.usc.edu


I am looking for references on graph matching. Especially, matching
inexact graphs (noisy). Most graph theory books seem to skirt around
this topic. thanks for any info,

Venkat.

venkat@sipi.usc.edu