Path: utzoo!attcan!utgpu!jarvis.csri.toronto.edu!rutgers!gatech!hubcap!dak
From: dak@tillamook.cs.uoregon.edu (David Alan Keldsen)
Newsgroups: comp.parallel
Subject: Is there a known distance function for DeBruijn networks?
Keywords: DeBruijn, distance, fast algorithm
Message-ID: <5989@hubcap.clemson.edu>
Date: 14 Jul 89 13:23:12 GMT
Sender: fpst@hubcap.clemson.edu
Lines: 11
Approved: parallel@hubcap.clemson.edu

Is there a known fast algorithm for computing the distance between two
nodes in a DeBruijn network?  Our group is aware of a quadratic-time (in
the number of bits in the node label) algorithm, but something quicker
and more intuitive would be useful.

Please email replies to the .signature address; I'll summarize and post results
if there is interest.
/* David A. Keldsen, a.k.a. 'Dak'  	Internet: dak@cs.uoregon.edu   
 * Resemblance of the above to the policies of any organization is purely 
 * coincidental and unintentional.  No lawyer-serviceable opinions inside.
 */