- To: mathgroup at smc.vnet.net
- Subject: [mg21395] graph isomorphism
- From: "Arturas Acus" <acus at itpa.lt>
- Date: Mon, 3 Jan 2000 03:12:26 -0500 (EST)
- Sender: owner-wri-mathgroup at wolfram.com
recently I lacked a function in "Combinatorica" package
that could decide if two given graphs are isomorphics.
After some attempts I found an abstract in recent
scientific paper by Lin Chen "Graph isomorphism and
identification matrices: sequential algorithms"
in "Journal of computer and system sciences",
It is claimed in the paper
abstrct that the graph isomorphism problem
is "a famous open problem".
I know that this problem do not meet purposes of
the group, but sometimes similar
questions (especially in
ccombinatoric) are answered. So probably somebody
can advice me where to find more information
about the problem. At least, is it proved that
this problem is NP complete?
Unfortunately the article is not avialable
Thanks in advice
Dr. Arturas Acus
Institute of Theoretical
Physics and Astronomy
Gostauto 12, 2600,Vilnius
E-mail: acus at itpa.lt
Prev by Date:
Problem with Rasters & Density Plots
Next by Date:
Re: A better way to decimate a file??
Previous by thread:
Re: Re: Problem with Rasters & Density Plots
Next by thread:
Re: RE: Kronecker product of matrices