On Fri, Dec 01, 2000, Shlomi Fish wrote about "Re: [hackers-il] Updated version of Graph Isomorphism Algorithm":

> Well part of the reason that I post the versions here is so that I'll have

> prior art claims. I don't plan to patent the algorithm, but I wish to be

> credited for it. Otherwise, I also wish to receive feedback for it.

Ok ;) Though I have to warn you - the hackers-il mailing-list isn't exactly

a known group of graph-algorithmers, so saying "I mailed it to hackers-il

first" wouldn't give you much against another researcher who sent his research

to an accredited journal...

> > By the way, I assume you studied Graph Algorithms in the Technion, and read

> > a book about it, like Shimon Even's great "Graph Algorithms", right? If not,

> > this would certainly be the first step before dabbling in graph algorithms ;)

> I took a course of the Electrical Engineering faculty named "Intro to Data

> Structures and Algorithms" which covers graph algorithms among other

> things. There weren't too many proves there, though. I also once took a

> correspondence course for Youth about graph theory. I glanced through the

> first chapter of Even's book, but did not read it thouroughly yet.

If you're interested in the subject, I wholeheartedly recommend reading

Prof. Even's book, even though it is not an easy undertaking. That book is

now out-of-print, but you can try getting it in the Technion library.

I don't know what they teach in "Intro to Data Structures and Algorithms",

but Even teaches his "Algorithms in Graph Theory" course following his

book almost exactly, so if you read the book you'll know everything they

teach in the Technion's CS "Algorithms in Graph Theory" course.

> Anyway, I did meet with Prof. Even's last Monday, and he noted why the

> initial version of the alogirthm would not always work. I deduced other

> cases why the later versions wouldn't work based on his example. It is my

> intention to meet him next Monday (at his office hours) and present to him

> the most recent version and ask for his opinion and input.

That's good :) I don't want to doubt the inteligence of myself and other

people in this list, but let's just say that Prof. Even is probably an

order-of-magnitude better in Graph Theory then the rest of us, so if you

got him to help you, that is great.

> I don't think this discussion is off topic, but if enough people are fed

> up with it, I will lower the posting rate.

Don't worry - even if you send an daily update it won't bother me too much ;)

But I was just trying to suggest to you a more productive method than sending

us an update each day. I don't know about the other people of the mailing

list, but I know that I don't have patience to read your code every day, try

to see what changed, and what is still wrong with the algorithm, etc., so I

doubt I'll be able to help you much...

--

Nadav Har'El | Friday, Dec 1 2000, 4 Kislev 5761

nyh@... |-----------------------------------------

Phone: +972-53-245868, ICQ 13349191 |Tea or coffee? Coffee, without cream. It

http://nadav.harel.org.il |will be without milk, we have no cream.