Elbassioni, Khaled Algorithms and Complexity, MPI for Informatics, Max Planck Society;
Khachiyan, L., Boros, E., Borys, K., Elbassioni, K., Gurvich, V., & Makino, K. (2007). Enumerating Spanning and Connected Subsets in Graphs and Matroids. Journal of the Operations Research Society of Japan, 50(4), 325-338. Retrieved from http://ci.nii.ac.jp/cinii/servlet/QuotDisp?LOCALID=ART0008517684&DB=NELS&USELANG=en.