|
||||||||||
PREV NEXT | FRAMES NO FRAMES |
Packages that use LowerBound | |
---|---|
nl.uu.cs.treewidth.algorithm |
Uses of LowerBound in nl.uu.cs.treewidth.algorithm |
---|
Classes in nl.uu.cs.treewidth.algorithm that implement LowerBound | |
---|---|
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 |
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 |
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 |
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 |
Ramachandramurthi<D extends GraphInput.InputData>
The 'Ramachandramurthi' lower bound. |
Methods in nl.uu.cs.treewidth.algorithm that return LowerBound | |
---|---|
LowerBound<GraphInput.InputData> |
LowerBound.Creator.create()
|
|
||||||||||
PREV NEXT | FRAMES NO FRAMES |