Clique (graph theory)

Known as: Clique (disambiguation), K-clique, Maximum clique

In the mathematical area of graph theory, a clique (/ˈkliːk/ or /ˈklɪk/) is a subset of vertices of an undirected graph such that its induced…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2015

Visual place recognition with local features often uses RANSAC to estimate a 3D transformation between images. However…

2011

We prove that if $G$ is the line graph of a multigraph, then the chromatic number $\chi(G)$ of $G$ is at most $\max\left\{\omega…

Review

2007

Review

2007

In this chapter we propose a modification of CRF-like algorithms that allows for solving large-scale structured classification…

2003

In this paper, we present a heuristic method to solve the maximum clique problem, based on the concepts of penalty and…

1998

Computation of marginal probabilities in Bayes nets is central to numerous reasoning and automatic decision-making systems. This…

1996

We present an $O(n)$ algorithm to find a maximum clique in a proper circular arc graph. We assume that the input graph is…

1994

Presents a novel and efficient genetic approach for finding maximal cliques in a graph. A binary alphabet has been chosen to…

1993

MAX-CLIQUE is the optimization problem of finding a largest clique in a given graph. By reduction to MAX-CLIQUE, the following…

1984

The main result of this paper states that the Krull dimension of a fully bounded Noetherian ring containing an uncountable…

1972

Abstract : An algorithm for finding a maximum clique in an arbitrary graph is described. The algorithm has a worst-case time…