Limbo
|
Various graph simplification techniques for graph coloring. Some of them can also be used in other applications. More...
#include <iostream>
#include <fstream>
#include <vector>
#include <stack>
#include <list>
#include <string>
#include <map>
#include <set>
#include <deque>
#include <boost/graph/graph_concepts.hpp>
#include <boost/graph/graph_utility.hpp>
#include <boost/graph/adjacency_list.hpp>
#include <boost/graph/undirected_graph.hpp>
#include <boost/property_map/property_map.hpp>
#include <limbo/preprocessor/AssertMsg.h>
#include <limbo/math/Math.h>
#include <limbo/algorithms/GraphUtility.h>
Go to the source code of this file.
Classes | |
class | limbo::algorithms::coloring::GraphSimplification< GraphType > |
Namespaces | |
limbo | |
namespace for Limbo | |
limbo::algorithms | |
namespace for Limbo.algorithms | |
limbo::algorithms::coloring | |
namespace for Limbo.Algorithms.Coloring | |
Various graph simplification techniques for graph coloring. Some of them can also be used in other applications.
Current simplification techniques include iterative vertex removal, biconnected component, merge 4-clique structures, etc. See limbo::algorithms::coloring::GraphSimplification::strategy_type for detailed strategies.
Definition in file GraphSimplification.h.