implementation of initial cut-constraint class for the Branch&Cut algorithm for the Maximum C-Planar SubGraph problem. More...
#include <ogdf/basic/Array.h>
#include <ogdf/basic/Graph.h>
#include <ogdf/basic/Logger.h>
#include <ogdf/cluster/internal/EdgeVar.h>
#include <ogdf/cluster/internal/basics.h>
#include <ostream>
Go to the source code of this file.
Classes | |
class | ogdf::ArrayBuffer< E, INDEX > |
An array that keeps track of the number of inserted elements; also usable as an efficient stack. More... | |
class | ogdf::cluster_planarity::ChunkConnection |
Namespaces | |
abacus | |
ogdf | |
The namespace for all OGDF objects. | |
ogdf::cluster_planarity | |
implementation of initial cut-constraint class for the Branch&Cut algorithm for the Maximum C-Planar SubGraph problem.
A feasible ILP solution has to imply a completely connected, planar Sub-Clustergraph. For each cluster that is not connected, additional connection edges have to be inserted between the chunks of the cluster, to obtain c-connectivity. Thus, initial constraints are added that guarantee initial c-connectivity, if the number of chunks is at most 3. If some cluster consists of more than 3 chunks, additional constraints have to be separated during the optimization.
Definition in file ChunkConnection.h.