Chapter

STACS 94

Volume 775 of the series Lecture Notes in Computer Science pp 759-768

Date:

Finding all minimal separators of a graph

  • T. KloksAffiliated withDepartment of Mathematics and Computing Science, Eindhoven University of Technology
  • , D. KratschAffiliated withFakultät für Mathematik und Informatik, Friedrich-Schiller-Universität

* 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.