| Calling Sequence
| MaxEdgeWeightClique(A)
|
| Parameters
| | Name | Type | Description |
|
| A
| Graph | a Graph with positive edge weights |
|
| Return Type
| set |
| Synopsis
| The input to this algorithm is an undirected graph.
An undirected graph is represented as a Graph data structure which
should accept three selectors: Nodes, Edges and Weight.
An approximation algorithm is used to find the best Clique.
The global variable CliqueIterFactor may be assigned a
non-negative number f. The larger f, the more accurate the answers
will be, and the more time the algorithm will consume.
The default behaviour is identical to setting CliqueIterFactor to 1.
The current version does part of the searching for the best solution
in a random way, so for large problems, different runs may give
different results.
This allows the algorithm to be run in parallel if necessary.
For convenience, the global variable TotalEdgeWeight is
assigned the sum of edge-weights of the clique found. |
| See also
| BipartiteGraph, Clique, DrawGraph, Edge, EdgeComplement, Edges, FindConnectedComponents, Graph, Graph_Rand, InduceGraph, MaxCut, MST, Nodes, Path, RegularGraph, ShortestPath, TetrahedronGraph, VertexCover |