Declaration of an exact c-planar subgraph algorithm, i.e., a maximum c-planar subgraph is computed using a branch and cut approach. More...
#include <ogdf/basic/Module.h>
#include <ogdf/basic/Timeouter.h>
#include <ogdf/cluster/CPlanarSubgraphModule.h>
#include <ogdf/cluster/ClusterGraph.h>
#include <ogdf/cluster/internal/MaxCPlanarMaster.h>
#include <ogdf/external/abacus.h>
#include <chrono>
#include <sstream>
Go to the source code of this file.
Classes | |
class | ogdf::MaximumCPlanarSubgraph |
Exact computation of a maximum c-planar subgraph. More... | |
Namespaces | |
namespace | ogdf |
The namespace for all OGDF objects. | |
Declaration of an exact c-planar subgraph algorithm, i.e., a maximum c-planar subgraph is computed using a branch and cut approach.
Definition in file MaximumCPlanarSubgraph.h.