
MaxCliqueDyn
 Referenced in 37 articles
[sw08507]
 Maximum Clique Algorithm: MaxCliqueDyn is a fast exact algorithm for finding a maximum clique ... subgraph of a graph and a maximum clique is the clique with the largest number ... vertices in a given graph. Maximum clique algorithms differ from maximal clique algorithms (e.g., Bron ... that cannot be enlarged), while the maximum clique algorithms find a maximum clique (a clique...

QUALEX
 Referenced in 51 articles
[sw04742]
 trust region technique for the maximum weight clique problem A new simple generalization ... MotzkinStraus theorem for the maximum weight clique problem is formulated and directly proved. Within ... DIMACS benchmark graphs and various random maximum weight clique problem instances...

BHOSLIB
 Referenced in 18 articles
[sw08220]
 Hidden Optimum Solutions for Graph Problems (Maximum Clique, Maximum Independent Set, Minimum Vertex Cover...

BBMCL
 Referenced in 16 articles
[sw11525]
 Relaxed approximate coloring in exact maximum clique search. This paper presents selective coloring ... paradigm for branchandbound exact maximum clique search. Approximate coloring has, in recent, years...

MaxAO
 Referenced in 22 articles
[sw05032]
 relaxations of maximum stable set and maximum clique problems,graph input...

BBMCSP
 Referenced in 9 articles
[sw17718]
 exact maximum clique algorithm for large and massive sparse graphs. This paper describes ... very efficient branchandbound exact maximum clique algorithm BBMCSP, designed for large and massive ... fields. Stateoftheart exact maximum clique algorithms encode the adjacency matrix in full...

NuMVC
 Referenced in 13 articles
[sw08219]
 current best exact algorithm for Maximum Clique on random instances as well as some structured...

gpulsmwcp
 Referenced in 5 articles
[sw41468]
 local search heuristic for the maximum weight clique problem on massive graphs. Given an undirected ... positive weights on the vertices, the maximum weight clique problem (MWCP) consists in finding ... clique with maximum total weight. In this paper, we present a CPUGPU local search...

SCCWalk
 Referenced in 4 articles
[sw32102]
 search algorithm and its improvements for maximum weight clique problem. The maximum weight clique problem ... important generalization of the maximum clique problem with wide applications. In this study, we develop...

BBMCW
 Referenced in 4 articles
[sw21469]
 enhanced bitstring encoding for exact maximum clique search in sparse graphs. This paper describes BBMCW ... efficient exact maximum clique algorithm tailored for large sparse graphs which can be bitencoded...

ilsmwis
 Referenced in 8 articles
[sw41470]
 best heuristics for the maximum weight clique problem. The results also show that the hybrid...

BITSCAN
 Referenced in 3 articles
[sw21470]
 efficient state of the art maximum clique algorithm. It has also been applied in PASS...

PMC
 Referenced in 1 article
[sw21471]
 Parallel Maximum Clique (PMC) Library. A parameterized high performance library for computing maximum cliques ... graphs. Features: General framework for parallel maximum clique algorithms. Optimized to be fast for large ... large dynamic networks. Parameterized for computing kcliques as fast as possible. Includes a variety ... tight linear time bounds for the maximum clique problem. Ordering of vertices for each algorithm...

MotifClick
 Referenced in 2 articles
[sw29728]
 regulatory binding sites via merging cliques. Background: Although dozens of algorithms and tools have been ... vertices by an edge if the maximum number of matches of the local gapless alignments ... mers from a merged group of maximum cliques associated with some vertices. Conclusions: When evaluated...

shoeprintr
 Referenced in 1 article
[sw35675]
 dimensional footwear outsole images using maximum cliques and speededup robust feature. Footwear examiners ... impression and aligns them using a maximum clique (MC). After alignment, an algorithm we denote...

IncMaxCLQ
 Referenced in 1 article
[sw21468]
 bounds for the cardinality of a maximum clique of a graph. However, existing upper bounds...

GraphCombEx
 Referenced in 0 articles
[sw32090]
 design. The problems currently supported include maximum clique, graph colouring, maximum independent set, minimum vertex...

HEWN
 Referenced in 3 articles
[sw02189]
 CLIQUE problem. A Hierarchical EdgeWeighted Network (HEWN) which is equivalent to the corresponding Maximum ... built and hence the size of maximal clique is found. It is proved that HEWN...

CoCoA
 Referenced in 654 articles
[sw00143]
 CoCoA is a system for Computations in Commutative...