All Separating Triangles in a Plane Graph Can Be Optimally Broken in Polynomial Time

Anna Accornero, Massimo Ancona, Sonia Varini. All Separating Triangles in a Plane Graph Can Be Optimally Broken in Polynomial Time. Int. J. Found. Comput. Sci., 11(3):405-421, 2000.

Abstract

Abstract is missing.