Mathematica 9 is now available
Services & Resources / Wolfram Forums
-----
 /
MathGroup Archive
1995
*January
*February
*March
*April
*May
*June
*July
*August
*September
*October
*November
*December
*Archive Index
*Ask about this page
*Print this page
*Give us feedback
*Sign up for the Wolfram Insider

MathGroup Archive 1995

[Date Index] [Thread Index] [Author Index]

Search the Archive

Re: Isomorphic Graphs

  • Subject: [mg2786] Re: Isomorphic Graphs
  • From: hiroshi at teine.chem2.hokudai.ac.jp (Hiroshi Murakami)
  • Date: Sun, 17 Dec 1995 02:06:32 -0500
  • Approved: usenet@wri.com
  • Distribution: local
  • Newsgroups: wri.mathgroup
  • Organization: Hokkaido Univ., Sapporo, Japan.

In article <4a5i49$gol at dragonfly.wri.com>,
Simon Robertson <simonr at vironix.co.za> wrote:
>I have developed an algorithm for determining if two graphs are isomorphic.
>Could someone please give me the name and address of any SA computer science
>journals that would be interested in publishing this paper.

What is the computational complexity of your method
for the "n" vertex graphs to determine if they are
isomorphic? I thought it was one of the NP problems.


  • Prev by Date: book announcement
  • Next by Date: ParametricPlot3D, color with function ?
  • Previous by thread: Isomorphic Graphs
  • Next by thread: Re: Isomorphic Graphs