defaultEliminationSequenceStrategy.h File Reference

An efficient unconstrained elimination sequence algorithm. More...

#include <agrum/agrum.h>
#include <agrum/graphs/algorithms/simplicialSet.h>
#include <agrum/graphs/algorithms/triangulations/eliminationStrategies/unconstrainedEliminationSequenceStrategy.h>
#include <agrum/graphs/graphElements.h>

Include dependency graph for defaultEliminationSequenceStrategy.h:

This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Classes
class	gum::DefaultEliminationSequenceStrategy
	An efficient unconstrained elimination sequence algorithm. More...

Namespaces
	gum
	gum is the global namespace for all aGrUM entities

Detailed Description

An efficient unconstrained elimination sequence algorithm.

Class DefaultEliminationSequenceStrategy implements an unconstrained elimination sequence algorithm (that is, there is no external constraint on the possible elimination ordering). The ordering is determined as follows:

the nodes that are simplicial (i.e., those that already form a clique with

their neighbors) are eliminated first

then the nodes that are almost simplicial (i.e. if we remove one of their

neighbors, they become simplicial) and that create small cliques, are eliminated (see Bodlaender's safe reductions)

the quasi simplicial nodes (i.e., the nodes that do not require many

fill-ins to create cliques) that would create small cliques, are eliminated

finally, the heuristic proposed by Kjaerulff(90) is used to compute the

last nodes to be eliminated.

Author

Christophe GONZALES and Pierre-Henri WUILLEMIN

Definition in file defaultEliminationSequenceStrategy.h.