coloring part of algorithm for maximum cliques
- Author
- Tobias Achterberg
-
Ralf Borndoerfer
-
Zoltan Kormos
-
Kati Wolter
Definition in file tclique_coloring.h.
#include "blockmemshell/memory.h"
#include "tclique/tclique.h"
Go to the source code of this file.
|
| typedef struct _ITV | ITV |
| |
| typedef struct _LIST_ITV | LIST_ITV |
| |
| typedef struct _NBC | NBC |
| |
|
| TCLIQUE_WEIGHT | tcliqueColoring (TCLIQUE_GETNNODES((*getnnodes)), TCLIQUE_GETWEIGHTS((*getweights)), TCLIQUE_SELECTADJNODES((*selectadjnodes)), TCLIQUE_GRAPH *tcliquegraph, BMS_CHKMEM *mem, int *buffer, int *V, int nV, NBC *gsd, TCLIQUE_Bool *iscolored, TCLIQUE_WEIGHT *apbound, int *clique, int *nclique, TCLIQUE_WEIGHT *weightclique) |
| |
| TCLIQUE_WEIGHT tcliqueColoring |
( |
TCLIQUE_GETNNODES((*getnnodes)) |
, |
|
|
TCLIQUE_GETWEIGHTS((*getweights)) |
, |
|
|
TCLIQUE_SELECTADJNODES((*selectadjnodes)) |
, |
|
|
TCLIQUE_GRAPH * |
tcliquegraph, |
|
|
BMS_CHKMEM * |
mem, |
|
|
int * |
buffer, |
|
|
int * |
V, |
|
|
int |
nV, |
|
|
NBC * |
gsd, |
|
|
TCLIQUE_Bool * |
iscolored, |
|
|
TCLIQUE_WEIGHT * |
apbound, |
|
|
int * |
clique, |
|
|
int * |
nclique, |
|
|
TCLIQUE_WEIGHT * |
weightclique |
|
) |
| |
colors the positive weighted nodes of a given set of nodes V with the lowest possible number of colors and finds a clique in the graph induced by V, an upper bound and an apriori bound for further branching steps
- Parameters
-
| tcliquegraph | pointer to graph data structure |
| mem | block memory |
| buffer | buffer of size nnodes |
| V | non-zero weighted nodes for branching |
| nV | number of non-zero weighted nodes for branching |
| gsd | neighbour color information of all nodes |
| iscolored | coloring status of all nodes |
| apbound | pointer to store apriori bound of nodes for branching |
| clique | buffer for storing the clique |
| nclique | pointer to store number of nodes in the clique |
| weightclique | pointer to store the weight of the clique |
