Newsgroups: comp.theory
Path: utzoo!utgpu!news-server.csri.toronto.edu!rpi!clarkson!clutx.clarkson.edu!banavana
From: banavana@clutx.clarkson.edu (Narasimhas Banavara)
Subject: GRAPH ISOMORPHISMS !
Reply-To: banavana@clutx.clarkson.edu (Narasimhas Banavara)
Organization: Clarkson University
Date: Wed, 24 Apr 1991 00:20:02 GMT
Message-ID: <1991Apr24.002002.9063@grape.ecs.clarkson.edu>
Sender: usenet@grape.ecs.clarkson.edu

	



	Hi, 
	   can someone explain me the "Standard Self-Reducibility"
	of graphs which enables to search for "an" isomorphism between
	two graphs G and H given an algorithm which tells us whether 
	the two graphs are "isomorphic".

	Thanks in advance.

	Narsim.

 		email : banavana@sun.mcs.clarkson.edu
			banavana@clutx.clarkson.edu