TMFG

Triangulated Maximally Filtered Graph

Computes a Planar Maximally Filtered Graph (PMFG) starting from a tetrahedron and inserting recursively vertices inside existing triangles (T2 move) in order to approximate a maxiaml planar graph with the largest total weight - non negative weights.
See: http://arxiv.org/pdf/1505.02445.pdf.
Guido Previde Massara, T. Di Matteo, and Tomaso Aste. "Network Filtering or Big Data: Triangulated Maximally Filtered Graph." arXiv preprint arXiv:1505.02445 (2015).