Kloks, T. and Kratsch, D. (2006) Listing All Minimal Separators of a Graph. Proceedings of the 11th Annual Symposium on Theoretical Aspects of Computer Science, Springer, LNCS 775, 759-768.
http://dx.doi.org/10.1137/s009753979427087x

has been cited by the following article:

• TITLE: Near-Optimal Placement of Secrets in Graphs

  AUTHORS: Werner Poguntke

  KEYWORDS: Graph Algorithm, Cut, Secret Sharing, Approximation, Network Design

  JOURNAL NAME: Open Journal of Discrete Mathematics, Vol.6 No.4, September 2, 2016

  ABSTRACT: We consider the reconstruction of shared secrets in communication networks, which are modelled by graphs whose components are subject to possible failure. The reconstruction probability can be approximated using minimal cuts, if the failure probabilities of vertices and edges are close to zero. As the main contribution of this paper, node separators are used to design a heuristic for the near-optimal placement of secrets sets on the vertices of the graph.