Hi, I would be really happy to work with David Coudert: I have already read some of his papers (in particular, dealing with the hyperbolicity of a graph). In any case, if you agree, I will submit my project to GSoC. If we find a way to make it work, great, otherwise I will try to carry on the project in my spare time. Good luck with your NP-hard problems! Michele
On Friday, March 13, 2015 at 5:09:43 PM UTC+1, Nathann Cohen wrote: > > Helloooooo, > > > I understand you are not interested in becoming a GSoC mentor: can > anybody > > else be interested in being my mentor? > > Hmmmm... Well, I just went to ask David Coudert if he might be > interested. Truth is, he works a lot (with Sage or with other graph > libraries) on algorithms for *big* graphs, and he will certainly be > very interested (and contribute) to anything that happen in Sage on > that front. On the other hand, he is also in charge of many things at > the moment in his non-Sage life, and is not quite sure either of what > being a GSOC mentor involves. > > > Of course, I do not expect to improve functions like add_edge, > > get_neighbours etc. My goal would be to speed-up the main algorithms: > for > > example, BFS can run on graphs with 1 million nodes and 10 millions > edges in > > fractions of a second, which is the time Sage needs for graphs with > 100.000 > > nodes and 1 million edges. > > Ahahaha. This is what he wants, too. I am more the NP-Hard kind of > guy. Graphs with 100nodes max, and optimization problems that take > forever ;-) > > Nathann > -- You received this message because you are subscribed to the Google Groups "sage-gsoc" group. To unsubscribe from this group and stop receiving emails from it, send an email to [email protected]. To post to this group, send email to [email protected]. Visit this group at http://groups.google.com/group/sage-gsoc. For more options, visit https://groups.google.com/d/optout.
