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

Packages that use Algorithm
nl.uu.cs.treewidth.algorithm   
nl.uu.cs.treewidth.testing   
 

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

Subinterfaces of Algorithm in nl.uu.cs.treewidth.algorithm
 interface Constructive<D extends GraphInput.InputData>
          Interface for algorithms that produce a tree decomposition.
 interface Exact<D extends GraphInput.InputData>
          Interface for algorithms that calculate the exact treewidth.
 interface LowerBound<D extends GraphInput.InputData>
          Interface for algorithms that compute a lowerbound.
 interface Permutation<D extends GraphInput.InputData>
           
 interface UpperBound<D extends GraphInput.InputData>
          Interface for algorithms that compute an upperbound.
 

Classes in nl.uu.cs.treewidth.algorithm that implement Algorithm
 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 AllStartMaximumMinimumDegree<D extends GraphInput.InputData>
          The degeneracity of a graph is a lower bound for treewidth.
 class AllStartMaximumMinimumDegreePlusLeastC<D extends GraphInput.InputData>
          The MMD+ heuristic with the least-c contraction rul: when there is a tiebreaker, we contract such that the contracted vertices have the smallest number of common neighbors.
 class AllStartMinorMinWidth<D extends GraphInput.InputData>
          The algorithm repeativly contracts the lowest degree vertex with a lowest degree neighbor.
 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 MaximumMinimumDegree<D extends GraphInput.InputData>
          The degeneracity of a graph is a lower bound for treewidth.
 class MaximumMinimumDegreePlusLeastC<D extends GraphInput.InputData>
          The MMD+ heuristic with the least-c contraction rul: when there is a tiebreaker, we contract such that the contracted vertices have the smallest number of common neighbors.
 class MaximumMinimumDegreePlusMaxD<D extends GraphInput.InputData>
          The MMD+Max-d: Maximum Minimum Degree Plus max-d: gives the maximum over the minimum degrees of the vertices in the graph.
 class MaximumMinimumDegreePlusMinD<D extends GraphInput.InputData>
          The MMD+Min-d: Maximum Minimum Degree Plus min-d: gives the maximum over the minimum degrees of the vertices in the graph.
 class MinDegree<D extends GraphInput.InputData>
          The 'minimum degree' lower bound: gives the minimum degree of a vertex in the graph.
 class MinorMinWidth<D extends GraphInput.InputData>
          Used graphstructure: NeighborHashSetGraph The 'MinorMinWidth' lower bound.
 class PermutationGuesser<D extends GraphInput.InputData>
           
 class PermutationToTreeDecomposition<D extends GraphInput.InputData>
           
 class PreProcessor<D extends GraphInput.InputData>
           
 class QuickBB<D extends GraphInput.InputData>
          A branch and bound algorithm for treewidth, designed by Gogate and Dechter.
 class Ramachandramurthi<D extends GraphInput.InputData>
          The 'Ramachandramurthi' lower bound.
 class TreewidthDP<D extends GraphInput.InputData>
           
 

Uses of Algorithm in nl.uu.cs.treewidth.testing
 

Methods in nl.uu.cs.treewidth.testing that return Algorithm
 Algorithm<D> ResultChecker.AlgoCreator.create()