Hello everybody !!!! I just submitted to trac a new patch which I hope will be the beginning of a long sequence in graph Theory. This patch lets one computes, given two graphs G and H, whether G has H as a minor. it is based on linear programming, and often slow, but there are very few if any practical algorithms available to compute it.
http://trac.sagemath.org/sage_trac/ticket/8404 -- NO -- graph theory library other than Sage has it at the moment. With a bit of luck, it may be followed by other formulations to compute Treewidth, Pathwidth, etc.... And of course... it needs review ! :-) Nathann -- To post to this group, send an email to sage-devel@googlegroups.com To unsubscribe from this group, send an email to sage-devel+unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/sage-devel URL: http://www.sagemath.org
