Class BacktrackVertexSeparator

All Implemented Interfaces:
VertexSeparatorAlgorithm

public class BacktrackVertexSeparator extends VertexSeparatorBase
WORK IN PROGRESS. Attempts at finding an optimum vertex separator using a systematic exploration of the search space. The backtracking is implemented in a non-recursive manner, using multiple threads.

A time limit may be imposed. If the algorithm stops due to the time limit, it will return the best separator found until then.

Author:
Cristian Frăsinaru
  • Constructor Details

    • BacktrackVertexSeparator

      public BacktrackVertexSeparator(Graph graph)
    • BacktrackVertexSeparator

      public BacktrackVertexSeparator(Graph graph, int maxShoreSize)
  • Method Details