Uses of Interface
nl.uu.cs.treewidth.algorithm.Permutation

Packages that use Permutation
nl.uu.cs.treewidth.algorithm   
 

Uses of Permutation in nl.uu.cs.treewidth.algorithm
 

Classes in nl.uu.cs.treewidth.algorithm that implement Permutation
 class AllStartLexBFS<D extends GraphInput.InputData>
          Triangulation by using the elimination scheme found by applying the LEX-P algorithm.
 class AllStartMaximumCardinalitySearch<D extends GraphInput.InputData>
          Triangulation by using the elimination scheme obtained by using the MCS (Maximum Cardinality Search) algorithm as given by Tarjan and Yannakakis.
 class AllStartMaximumCardinalitySearchMinimal<D extends GraphInput.InputData>
          Triangulation obtained by using the elimination scheme produced by the MCS (Maximum Cardinality Search) algorithm of Berry et al.
 class GreedyDegree<D extends GraphInput.InputData>
          The GreedyDegree algorithm computes a permutation and at the same time derives an upperbound.
 class GreedyFillIn<D extends GraphInput.InputData>
          The GreedyFillIn algorithm computes a permutation and at the same time derives an upperbound.
 class LexBFS<D extends GraphInput.InputData>
          Triangulation by using the elimination scheme found by applying the LEX-P algorithm.
 class MaximumCardinalitySearch<D extends GraphInput.InputData>
          Triangulation by using the elimination scheme obtained by using the MCS (Maximum Cardinality Search) algorithm as given by Tarjan and Yannakakis.
 class MaximumCardinalitySearchMinimal<D extends GraphInput.InputData>
          Triangulation obtained by using the elimination scheme produced by the MCS (Maximum Cardinality Search) algorithm of Berry et al.
 class QuickBB<D extends GraphInput.InputData>
          A branch and bound algorithm for treewidth, designed by Gogate and Dechter.
 

Constructors in nl.uu.cs.treewidth.algorithm with parameters of type Permutation
PermutationToTreeDecomposition(Permutation<D> permAlg)
          Create an instance of the PermutationToTreeDecomposition algorithm and use a Permutation algorithm to get the permutation.