On Mon, Oct 29, 2012 at 02:35:47AM -0700, P Purkayastha wrote: > > I wonder if it is less computationally demanding to walk around the graph > than take powers of M, especially for large, but sparsely connected graphs. >
May be you are right. Powers of the matrix appear easier to implement IMHO. After some reading I don't think you can do better than O(n^(3-epsilon)) because of odd cycles. -- You received this message because you are subscribed to the Google Groups "sage-support" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. Visit this group at http://groups.google.com/group/sage-support?hl=en.
