Interest in Cycle enumeration methods in Graphs for GSOC 2025

[Muhammad Imad raza]

Hello

I hope you're doing well, I'm Muhammad Imad Raza, a third year undergraduate from Pakistan. 

I am interested to work on the project "Path and Cycles Enumeration Methods in Graphs", I have experience with data structures and algorithms, and I'm currently studying Graph theory. 

I wanted to know more about the project and if there were any other official channels apart from this where collaborators can communicate.

Best
Muhammad Imad Raza

[David Coudert]

Thank you for your interest in this project.

This is the correct channel to communicate.

Recall that the short description gives ideas for the project and you, the potential contributor, are expected to turn the ideas into a full proposal.

It is strongly suggested to start reading the developper guide of Sagemath, and the application guide https://wiki.sagemath.org/GSoC/Contributors 

For algorithms, you can read for instance recent papers on the k shortest simple paths like

- https://dl.acm.org/doi/pdf/10.1145/3626567  and references there in

- https://link.springer.com/article/10.1007/s12532-025-00276-0 

Sincerely,

David.

--
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 sage-gsoc+...@googlegroups.com.
To view this discussion visit https://groups.google.com/d/msgid/sage-gsoc/f3625594-8a83-4b7d-8912-bd955e83b393n%40googlegroups.com.

——
David Coudert
Equipe-Projet COATI
Centre Inria d’Université Côte d'Azur
Université Côte d’Azur, Inria, CNRS, I3S, France
http://www-sop.inria.fr/members/David.Coudert/