MaxIndependentSet.h File Reference

solve maximum independent sets with maximum cliques More...

#include <deque>
#include <boost/graph/bron_kerbosch_all_cliques.hpp>
#include <limbo/algorithms/GraphUtility.h>

Go to the source code of this file.

Classes
class	limbo::algorithms::MaxIndependentSetByMaxClique
class	limbo::algorithms::MaxIndependentSetByMaxClique::clique_visitor_type< GraphType, MisVisitorType >
	callback for boost::bron_kerbosch_all_cliques More...

Namespaces
	limbo
	namespace for Limbo
	limbo::algorithms
	namespace for Limbo.algorithms

Functions
template<typename GraphType , typename VisitorType , typename AlgorithmType >
void	limbo::algorithms::max_independent_set (GraphType const &g, VisitorType vis, AlgorithmType const &)
template<typename GraphType , typename MisVisitorType >
void	limbo::algorithms::max_independent_set (GraphType const &g, MisVisitorType vis, MaxIndependentSetByMaxClique const &)

Detailed Description

solve maximum independent sets with maximum cliques

The maximum independent set of a graph is the maximum clique of its complement graph.

Author

Yibo Lin

Date

Feb 2015

Definition in file MaxIndependentSet.h.