nl.uu.cs.treewidth.algorithm
Class MaximumMinimumDegreePlusMinD2

java.lang.Object
  extended by nl.uu.cs.treewidth.algorithm.MaximumMinimumDegreePlusMinD2

public class MaximumMinimumDegreePlusMinD2
extends java.lang.Object

The MMD+Min-d: Maximum Minimum Degree Plus min-d: gives the maximum over the minimum degrees of the vertices in the graph. It contracts the choosen vertex with the neighbour with lowest degree Reference: Treewidth: Computational Experiments (Koster, Bodlaender, and van Hoesel)

Author:
tw team

Constructor Summary
MaximumMinimumDegreePlusMinD2()
          Starts out as a lowerbound of -infty; improved to the mindegree lowerbound once run() is called.
 
Method Summary
 int getLowerBound()
           
 java.lang.String getName()
           
 void run()
           
 void setInput(NGraph<nl.uu.cs.treewidth.algorithm.QuickBB.QuickBBData> g)
           
 
Methods inherited from class java.lang.Object
equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
 

Constructor Detail

MaximumMinimumDegreePlusMinD2

public MaximumMinimumDegreePlusMinD2()
Starts out as a lowerbound of -infty; improved to the mindegree lowerbound once run() is called.

Method Detail

getName

public java.lang.String getName()

setInput

public void setInput(NGraph<nl.uu.cs.treewidth.algorithm.QuickBB.QuickBBData> g)

run

public void run()

getLowerBound

public int getLowerBound()