[comp.theory.cell-automata] Self-Reducibility of Graphs !!

banavana@clutx.clarkson.edu (Narasimhas Banavara) (04/23/91)

	

	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