Dear Sai Harsh, thank you for your interest in this project. Yes, the second paper fix several issues of the first paper. Authors of the second paper have implemented the algorithm in C++ in OGDF (http://www.ogdf.net/). There are two options for this project: 1) create an interface with OGDF and use it, or 2) recode the method with sufficient documentation.
The first step is to get familiar with Sagemath, its graph module, and of course git. Best, David. Le samedi 17 février 2018 09:16:43 UTC+1, Sai Harsh Tondomker a écrit : > > Hi, > I am Sai Harsh, an MS by Research student at IIIT-Hyderabad and my > research domain is Graph metrics algorithms, currently doing a research > internship at University of Valencia, Spain. I read the project proposal > and also went through the referred papers. I understand that the second > paper aims at correcting the faults in paper one algorithm. I found the > project interesting and would like to make it my GSOC project. Should I > start coding the algorithm( finding tri-connected components) for > demonstration? > > I'd be glad to hear from you if there is anything more/else I can do at > this point in time. > > Thank you, > Sai Harsh > -- 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.
