MaxPlanarEdgesConstraint.h File Reference

Declaration of a constraint class for the Branch&Cut algorithm for the Maximum C-Planar SubGraph problem. More...

#include <ogdf/basic/List.h>
#include <ogdf/cluster/internal/EdgeVar.h>
#include <ogdf/cluster/internal/basics.h>
#include <ogdf/external/abacus.h>

Go to the source code of this file.

Classes
class	ogdf::cluster_planarity::MaxPlanarEdgesConstraint

Namespaces
	ogdf
	The namespace for all OGDF objects.
	ogdf::cluster_planarity

Detailed Description

Declaration of a constraint class for the Branch&Cut algorithm for the Maximum C-Planar SubGraph problem.

These constraint do not necessarily belong to the ILP formulation, but have the purpose to strengthen the LP-relaxations in the case of very dense Graphs, by restricting the maximum number of edges that can occur in any optimal solution according to Euler's formula for planar Graphs: |E| <= 3|V|-6

Author

Mathias Jansen

License:

This file is part of the Open Graph Drawing Framework (OGDF).

Copyright (C)
See README.md in the OGDF root directory for details.

This program is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License Version 2 or 3 as published by the Free Software Foundation; see the file LICENSE.txt included in the packaging of this file for details.

This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details.

You should have received a copy of the GNU General Public License along with this program; if not, see http://www.gnu.org/copyleft/gpl.html

Definition in file MaxPlanarEdgesConstraint.h.