Path: utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!swrinde!zaphod.mps.ohio-state.edu!rpi!clarkson!clutx.clarkson.edu!banavana
From: banavana@clutx.clarkson.edu (Narasimhas Banavara)
Newsgroups: comp.theory.cell-automata
Subject: Self-Reducibility of Graphs !!
Message-ID: <1991Apr22.201813.22479@grape.ecs.clarkson.edu>
Date: 22 Apr 91 20:18:13 GMT
Sender: usenet@grape.ecs.clarkson.edu
Reply-To: banavana@clutx.clarkson.edu (Narasimhas Banavara)
Organization: Clarkson University
Lines: 15


	

	Hi,
	  can someone explain me the "Standard Self-Reducibility"
	of graphs which enables us 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