Class MinimumVertexCutGlobalEsfahanianHakimi

  • All Implemented Interfaces:
    MinimumVertexCutGlobal

    public class MinimumVertexCutGlobalEsfahanianHakimi
    extends MinimumVertexCutGlobalAbstract
    Esfahanian-Hakimi algorithm for computing a minimum unweighted vertex cut in a graph.

    Based on 'On computing the connectivities of graphs and digraphs' by Abdol H. Esfahanian, S. Louis Hakimi.

    Author:
    Barak Ugav