Respected Sir,
I am a student of Birla Institute of Technology and Science,
Pilani Goa campus doing M Sc (Mathematics ) and B E (computer Science) . I
am very interested in graph theory and have also read some books on this
(apart from doing a course). I came across some interesting algorithms and
would like to implement some of them.
-Modular Decmposition Tree.
https://www.emis.de/journals/JGAA/accepted/2007/PapadopoulosVoglis2007.11.2.pdf
( lemma 2.1 looks implementable (easily), hypergraphs too in case you are
interested).
-Linear time modular decomposition of digraph
http://www.cs.colostate.edu/~rmm/digraphDecomp.pdf
( most of these algorithms can be implemented).
These are some of them , I would gladly implement other algorithms (or even
just learn) in case these are too trivial.
I am very good in C++ ,C ,Java (some knowledge of sage but not very
familiar with it).
I am sorry if you find this too random, I found them interesting and
thought might as well share it with you. I look forward to working with you
if you consider my application for GSOC 2017( if not? I still dont mind
implementing them for you as long as I get to learn new things).
I will send a detailed proposal if you would like to work with me.
Thank you
--
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.
