***** To join INSNA, visit http://www.sfu.ca/~insna/ *****
On Tue, Nov 18, 2003 at 05:51:14PM -0500, Guy Hagen wrote:
> I also encourage anyone else to take this opportunity to share their
> algorithms there!
Vlado Batagelj and myself have come up with efficient
(time and space optimal) algorithms for generating
graphs according to a variety of random graph models.
Most of them, I believe, are available in Pajek.
Prof. Dr. Ulrik Brandes
Department of Computer & | +49 7531 88 4433 (phone)
Information Science, Box D 67 | +49 7531 88 3577 (fax)
University of Konstanz | [log in to unmask]
78457 Konstanz, Germany | http://www.inf.uni-konstanz.de/~brandes/
SOCNET is a service of INSNA, the professional association for social
network researchers (http://www.sfu.ca/~insna/). To unsubscribe, send
an email message to [log in to unmask] containing the line
UNSUBSCRIBE SOCNET in the body of the message.