LINK [1] S. Tsukiyama, M. Ide, H. Ariyoshi, and I. Shirakawa,“A new algorithm for generating all the maximal independent sets,”SIAM Journal of Computing, vol.6, pp.505-517, 1977.

LINK [2] K. Makino and T. Uno,“New algorithms for enumerating all maximal cliques,”In Proc. of the 9th Scandinavian Workshop on Algorithm Theory (SWAT 2004), pp.260-272, Springer-Verlag, 2004.

LINK [3] E. Tomita, A. Tanaka, and H. Takahashi,“The worst-case time complexity for generating all maximal cliques andcomputational experiments,”Theor. Comp. Sci., vol.363, pp.28-42, 2006.