Lecture Notes in Computer Science Volume 775, 1994, pp 759-768
Date: 31 May 2005

Finding all minimal separators of a graph

* Final gross prices may vary according to local VAT.

Get Access

Abstract

In this paper we give an efficient algorithm to find all minimal vertex separators of an undirected graph. The algorithm needs polynomial time per separator that is found.