A B C D E F G H I J L M N O P Q R S T U V W

M

main(String[]) - Static method in class nl.uu.cs.treewidth.AlgoTester
 
main(String[]) - Static method in class nl.uu.cs.treewidth.demos.TDViewer
 
main(String[]) - Static method in class nl.uu.cs.treewidth.Hello
 
Main - Class in nl.uu.cs.treewidth
Little demo program to test the framework.
Main() - Constructor for class nl.uu.cs.treewidth.Main
 
main(String[]) - Static method in class nl.uu.cs.treewidth.Main
 
main(String[]) - Static method in class nl.uu.cs.treewidth.Runny
 
main(String[]) - Static method in class nl.uu.cs.treewidth.testing.BigTest
 
main(String[]) - Static method in class nl.uu.cs.treewidth.testing.MemoryTester
 
main(String[]) - Static method in class nl.uu.cs.treewidth.testing.ResultChecker
 
main(String[]) - Static method in class nl.uu.cs.treewidth.ThamasPlayground
 
maxClique(NGraph<D>) - Method in class nl.uu.cs.treewidth.algorithm.CliqueFinder
 
MaximumCardinalitySearch<D extends GraphInput.InputData> - Class in nl.uu.cs.treewidth.algorithm
Triangulation by using the elimination scheme obtained by using the MCS (Maximum Cardinality Search) algorithm as given by Tarjan and Yannakakis.
MaximumCardinalitySearch() - Constructor for class nl.uu.cs.treewidth.algorithm.MaximumCardinalitySearch
 
MaximumCardinalitySearchMinimal<D extends GraphInput.InputData> - Class in nl.uu.cs.treewidth.algorithm
Triangulation obtained by using the elimination scheme produced by the MCS (Maximum Cardinality Search) algorithm of Berry et al.
MaximumCardinalitySearchMinimal() - Constructor for class nl.uu.cs.treewidth.algorithm.MaximumCardinalitySearchMinimal
 
MaximumMinimumDegree<D extends GraphInput.InputData> - Class in nl.uu.cs.treewidth.algorithm
The degeneracity of a graph is a lower bound for treewidth.
MaximumMinimumDegree() - Constructor for class nl.uu.cs.treewidth.algorithm.MaximumMinimumDegree
Starts out as a lowerbound of -infty; improved to the mindegree lowerbound once run() is called.
MaximumMinimumDegreePlusLeastC<D extends GraphInput.InputData> - Class in nl.uu.cs.treewidth.algorithm
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.
MaximumMinimumDegreePlusLeastC() - Constructor for class nl.uu.cs.treewidth.algorithm.MaximumMinimumDegreePlusLeastC
Starts out as a lowerbound of -infty; improved to the mindegree lowerbound once run() is called.
MaximumMinimumDegreePlusMaxD<D extends GraphInput.InputData> - Class in nl.uu.cs.treewidth.algorithm
The MMD+Max-d: Maximum Minimum Degree Plus max-d: gives the maximum over the minimum degrees of the vertices in the graph.
MaximumMinimumDegreePlusMaxD() - Constructor for class nl.uu.cs.treewidth.algorithm.MaximumMinimumDegreePlusMaxD
Starts out as a lowerbound of -infty; improved to the mindegree lowerbound once run() is called.
MaximumMinimumDegreePlusMinD<D extends GraphInput.InputData> - Class in nl.uu.cs.treewidth.algorithm
The MMD+Min-d: Maximum Minimum Degree Plus min-d: gives the maximum over the minimum degrees of the vertices in the graph.
MaximumMinimumDegreePlusMinD() - Constructor for class nl.uu.cs.treewidth.algorithm.MaximumMinimumDegreePlusMinD
Starts out as a lowerbound of -infty; improved to the mindegree lowerbound once run() is called.
MaximumMinimumDegreePlusMinD2 - Class in nl.uu.cs.treewidth.algorithm
The MMD+Min-d: Maximum Minimum Degree Plus min-d: gives the maximum over the minimum degrees of the vertices in the graph.
MaximumMinimumDegreePlusMinD2() - Constructor for class nl.uu.cs.treewidth.algorithm.MaximumMinimumDegreePlusMinD2
Starts out as a lowerbound of -infty; improved to the mindegree lowerbound once run() is called.
MemoryTester - Class in nl.uu.cs.treewidth.testing
 
MemoryTester() - Constructor for class nl.uu.cs.treewidth.testing.MemoryTester
 
MinDegree<D extends GraphInput.InputData> - Class in nl.uu.cs.treewidth.algorithm
The 'minimum degree' lower bound: gives the minimum degree of a vertex in the graph.
MinDegree() - Constructor for class nl.uu.cs.treewidth.algorithm.MinDegree
Starts out as a lowerbound of -infty; improved to the mindegree lowerbound once run() is called.
MinorMinWidth<D extends GraphInput.InputData> - Class in nl.uu.cs.treewidth.algorithm
Used graphstructure: NeighborHashSetGraph The 'MinorMinWidth' lower bound.
MinorMinWidth() - Constructor for class nl.uu.cs.treewidth.algorithm.MinorMinWidth
Starts out as a lowerbound of -infty; improved to the mindegree lowerbound once run() is called.
MinorMinWidth_QuickBB<D extends GraphInput.InputData> - Class in nl.uu.cs.treewidth.algorithm
The 'MinorMinWidth' lower bound.
MinorMinWidth_QuickBB() - Constructor for class nl.uu.cs.treewidth.algorithm.MinorMinWidth_QuickBB
Starts out as a lowerbound of -infty; improved to the mindegree lowerbound once run() is called.
mouseDragged(MouseEvent) - Method in class nl.uu.cs.treewidth.output.NeatoViewer
 
mouseMoved(MouseEvent) - Method in class nl.uu.cs.treewidth.output.NeatoViewer
 

A B C D E F G H I J L M N O P Q R S T U V W