Finding all minimal separators of a graph

  • T. Kloks
  • D. Kratsch
Conference paper

DOI: 10.1007/3-540-57785-8_188

Part of the Lecture Notes in Computer Science book series (LNCS, volume 775)
Cite this paper as:
Kloks T., Kratsch D. (1994) Finding all minimal separators of a graph. In: Enjalbert P., Mayr E.W., Wagner K.W. (eds) STACS 94. STACS 1994. Lecture Notes in Computer Science, vol 775. Springer, Berlin, Heidelberg

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag 1994

Authors and Affiliations

  • T. Kloks
    • 1
  • D. Kratsch
    • 2
  1. 1.Department of Mathematics and Computing ScienceEindhoven University of TechnologyMB EindhovenThe Netherlands
  2. 2.Fakultät für Mathematik und InformatikFriedrich-Schiller-UniversitätJenaGermany

Personalised recommendations