Addition of SPQR-trees to the graph module of Sage Math
- Mentors
- David Coudert, Dima Pasechnik
- Organization
- Sage Mathematical Software System
The aim of the project is to code the linear time algorithm for partitioning a graph into 3-connected components and constructing the corresponding SPQR-tree of the graph. Further, this algorithm can be used as a subroutine for several other graph problems such as recognition of chordless graphs, hamiltonian cycle etc.