Listing all Minimal Separators of a Graph

Authors:
  • TKT. Kloks
    T. Kloks
  • DKD. Kratsch
    D. Kratsch

Abstract
An efficient algorithm listing all minimal vertex separators of an undirected graph is given. The algorithm needs polynomial time per separator that is found.

This publication has 15 references indexed in Scilit: