[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
random graphs
From: |
cal |
Subject: |
random graphs |
Date: |
Tue, 10 Apr 2001 20:33:29 -0700 |
hihi, all -
not all connected graphs have a hamiltonian path,
so the method proposed by chris langton cannot work
for example,
consider the star - 1 center and N-1 adjacent edges -
that graph will never be generated starting with a cycle
there are some very good books about combinatorial algorithms,
but this evening i am actually in santa fe,
not at home,
so i can't look them up until the weekend
more soon,
cal
Dr. Christopher Landauer
Aerospace Integration Science Center
The Aerospace Corporation, Mail Stop M6/214
P.O.Box 92957
Los Angeles, California 90009-2957, USA
e-mail: address@hidden, Phone: +1 (310) 336-1361
==================================
Swarm-Modelling is for discussion of Simulation and Modelling techniques
esp. using Swarm. For list administration needs (esp. [un]subscribing),
please send a message to <address@hidden> with "help" in the
body of the message.
==================================
[Prev in Thread] |
Current Thread |
[Next in Thread] |