On Wednesday, February 8, 2017 at 11:03:57 AM UTC, David Coudert wrote: > > That's clearly something we need. > If the student is good and fast, (s)he can also try to implement the > split-decomposition which is a generalization of modular decomposition that > can be computed in linear time (roughly finds complete bipartite graph > separators). > > Also, we could consider adding efficient implementations of several > graph-traversals like LexBFS. >
OK, I've added these too. > > David. > > Le mardi 7 février 2017 19:14:20 UTC+1, Dima Pasechnik a écrit : >> >> I've added a project on modular decomposition of graphs and digraphs. >> >> How many more we would like to have? >> >> On Thursday, January 19, 2017 at 6:05:19 PM UTC, Harald Schilly wrote: >>> >>> Hello, this year's Google Summer of Code 2017 just started. >>> >>> I assume we will try again to be part of it, and therefore I've >>> started the registration process. >>> >>> The most important aspect is to have mentors and project proposals. >>> For that, I've started this year's wiki page as a copy of last year: >>> >>> https://wiki.sagemath.org/GSoC/2017 (compare with 2016) >>> >>> The deadline for the application is Feb. 9th and I'm again working on >>> this like in the past 5 years. >>> >>> -- Harald >>> >> -- You received this message because you are subscribed to the Google Groups "sage-devel" group. To unsubscribe from this group and stop receiving emails from it, send an email to sage-devel+unsubscr...@googlegroups.com. To post to this group, send email to sage-devel@googlegroups.com. Visit this group at https://groups.google.com/group/sage-devel. For more options, visit https://groups.google.com/d/optout.
