On Tuesday, March 7, 2017 at 4:26:52 PM UTC, Lokesh Jain wrote: > > Hi > > I am M.Sc.(Hons.) Mathematics and B.E.(Hons.) Computer Science student at > BITS Pilani, Pilani Campus. I am currently interning with the Apache Hadoop > YARN team in Hortonworks. I am very interested in Graph Theory and look > forward to implement the Modular Decomposition of Graphs algorithm as a > GSOC project. I have found a research paper "Simpler Linear-Time Modular > Decomposition via Recursive Factorizing Permutations > <http://www.google.com/url?q=http%3A%2F%2Fwww.cs.toronto.edu%2F~mtedder%2FTedderModular.pdf&sa=D&sntz=1&usg=AFQjCNHs-Rq8h6w_TDvK0THTze8wUZCgEQ>" > > corresponding to that. It defines a practical linear time algorithm for > modular decomposition of graphs. I wanted to ask whether I should go ahead > with this research paper and try to implement it? >
yes, this is one that definitely should implemented (in C or Python). The only implementation I know is in Java, and it's probably quite old too. > > Regards > Lokesh > -- 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 https://groups.google.com/group/sage-gsoc. For more options, visit https://groups.google.com/d/optout.
