|
||||||||||
PREV NEXT | FRAMES NO FRAMES |
Packages that use UpperBound | |
---|---|
nl.uu.cs.treewidth.algorithm |
Uses of UpperBound in nl.uu.cs.treewidth.algorithm |
---|
Classes in nl.uu.cs.treewidth.algorithm that implement UpperBound | |
---|---|
class |
AllStartLexBFS<D extends GraphInput.InputData>
Triangulation by using the elimination scheme found by applying the LEX-P algorithm. |
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 |
PermutationGuesser<D extends GraphInput.InputData>
|
class |
PermutationToTreeDecomposition<D extends GraphInput.InputData>
|
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 UpperBound | |
---|---|
TreewidthDP(UpperBound<D> ubAlg)
Create an instance of the DP algorithm and use the supplied upperbound algorithm to calculate the initial upperbound. |
|
||||||||||
PREV NEXT | FRAMES NO FRAMES |