Hi, I am a mathematics student from Italy, I have familiarity with graph theory and combinatorial optimization and I'm interested in the Modular decomposition of graphs and digraphs project. It would be very helpful if you let me know your opinion about my proposals.
I would like to know if there is any algorithm that already performs modular decomposition of graphs in Sage and in that case if it is desirable to improve that/those algorithms and in which way. A possible new algorithm is the following one: http://www.cs.toronto.edu/~mtedder/TedderModular.pdf (Tedder, Corneil, Habib, Paul) In the case a new algorithm for directed graphs is needed, a possible one is http://www.cs.colostate.edu/~rmm/digraphDecomp.pdf (McConnell, de Montgolfier). For skew partition my choise would be: http://ect.bell-labs.com/who/kennedy/publications/papers/FastSkewPartAlg.pdf (Kennedy, Reed) I'm also looking for applications of modular decomposition in the field of combinatorial optimization and any suggestion from you in that sense would be really appreciated. Nice regards, Rosario Messana -- 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.
