• MaxCliqueDyn

  • Referenced in 38 articles [sw08507]
  • algorithm for finding a maximum clique in an undirected graph described in Ref. [1] developed ... fully connected subgraph of a graph and a maximum clique is the clique with ... number of vertices in a given graph. Maximum clique algorithms differ from maximal clique algorithms ... maximal cliques in a graph (cliques that cannot be enlarged), while the maximum clique algorithms...
  • Cliquer

  • Referenced in 72 articles [sw05044]
  • routines for finding cliques in an arbitrary weighted graph. It uses an exact branch...
  • Max-AO

  • Referenced in 23 articles [sw05032]
  • maximum stable set and maximum clique problems,graph input...
  • QUALEX

  • Referenced in 51 articles [sw04742]
  • Motzkin-Straus theorem for the maximum weight clique problem is formulated and directly proved. Within ... number of vertices of the graph. It was implemented in a publicly available software package ... DIMACS benchmark graphs and various random maximum weight clique problem instances...
  • CFinder

  • Referenced in 25 articles [sw12379]
  • CFinder: locating cliques and overlapping modules in biological networks. Summary: Most cellular tasks are performed ... densely interconnected groups of nodes in undirected graphs, and allowing the user to easily navigate ... between the original graph and the web of these groups. We show that in gene ... very efficient for locating the cliques of large sparse graphs. Availability: CFinder (for Windows, Linux...
  • BHOSLIB

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

  • Referenced in 7 articles [sw23172]
  • structures, such as the countably infinite clique graph or the set of all intervals with...
  • BBMCSP

  • Referenced in 10 articles [sw17718]
  • exact maximum clique algorithm for large and massive sparse graphs. This paper describes ... exact maximum clique algorithm BBMCSP, designed for large and massive sparse graphs which appear frequently ... clique algorithms encode the adjacency matrix in full but when dealing with sparse graphs some...
  • gpuls-mwcp

  • Referenced in 6 articles [sw41468]
  • heuristic for the maximum weight clique problem on massive graphs. Given an undirected graph with ... clique problem (MWCP) consists in finding a clique with maximum total weight. In this paper ... heuristic for solving the MWCP on massive graphs. The heuristic is based...
  • BBMCW

  • Referenced in 4 articles [sw21469]
  • 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 bit-encoded...
  • CliquePercolationMethod-R

  • Referenced in 1 article [sw38783]
  • size k, then creates a clique graph. Each community will be represented by each connected ... component in the clique graph...
  • BBMCL

  • Referenced in 17 articles [sw11525]
  • paradigm for branch-and-bound exact maximum clique search. Approximate coloring has, in recent, years ... fastest for a large subset of the graphs considered...
  • sgcp-via-cliques

  • Referenced in 2 articles [sw34590]
  • sgcp-via-cliques: Solving the (Weighted) Selective Graph Colouring Problem via Maximum Cliques...
  • PMC

  • Referenced in 1 article [sw21471]
  • performance library for computing maximum cliques in large sparse graphs. Features: General framework for parallel ... maximum clique algorithms. Optimized to be fast for large sparse graphs. Algorithms tested on networks ... large dynamic networks. Parameterized for computing k-cliques as fast as possible. Includes a variety ... tight linear time bounds for the maximum clique problem. Ordering of vertices for each algorithm...
  • GraphCombEx

  • Referenced in 0 articles [sw32090]
  • Efficient representation and applicability to large-scale graphs and complex networks are particularly considered ... problems currently supported include maximum clique, graph colouring, maximum independent set, minimum vertex clique covering...
  • COSMO

  • Referenced in 7 articles [sw40080]
  • semidefinite programs that arise in portfolio optimisation, graph theory, and robust control. Moreover, the solver ... uses chordal decomposition techniques and a new clique merging algorithm to effectively exploit sparsity...
  • IncMaxCLQ

  • Referenced in 1 article [sw21468]
  • cardinality of a maximum clique of a graph. However, existing upper bounds based on MaxSAT...
  • NeAT

  • Referenced in 1 article [sw21914]
  • connection between networks and clusters (graph-based clustering, cliques discovery and mapping of clusters onto...
  • RolX

  • Referenced in 8 articles [sw32343]
  • RolX: structural role extraction & mining in large graphs. Given a network, intuitively two nodes belong ... data, and could be, for example, ”clique-members,” ”periphery-nodes,” etc. Roles enable numerous novel ... This paper addresses the question: Given a graph, how can we automatically discover roles...