SIAMDM
2010
13 years 6 months ago
2010
Let G be a graph with n vertices and independence number . Hadwiger's conjecture implies that G contains a clique minor of order at least n/. In 1982, Duchet and Meyniel prov...
COCOA
2010
Springer
13 years 6 months ago
2010
Springer
An intense activity is nowadays devoted to the definition of models capturing the properties of complex networks. Among the most promising approaches, it has been proposed to model...
CVPR
2011
IEEE
13 years 7 months ago
2011
IEEE
This paper presents an algorithm for order reduction of
factors in High-Order Markov Random Fields (HOMRFs).
Standard techniques for transforming arbitrary high-order
factors in...
GC
2002
Springer
13 years 11 months ago
2002
Springer
Given a graph on n vertices which is the union of two comparability graphs on the same vertex set, it always contains a clique or independent set of size n 1 3 . On the other hand...
GC
2007
Springer
13 years 11 months ago
2007
Springer
A clique is a set of pairwise adjacent vertices in a graph. We determine the maximum number of cliques in a graph for the following graph classes: (1) graphs with n vertices and m ...
HEURISTICS
2006
13 years 11 months ago
2006
This paper investigates the capabilities of the Ant Colony Optimization (ACO) meta-heuristic for solving the maximum clique problem, the goal of which is to find a largest set of ...
CORR
2006
Springer
13 years 11 months ago
2006
Springer
Often an attacker tries to disconnect a network by destroying nodes or edges, while the defender counters using various resilience mechanisms. Examples include a music industry bod...
ENDM
2008
13 years 11 months ago
2008
A circular-arc graph is the intersection graph of a set of arcs on the circle. It is a Helly circular-arc graph if it has a Helly model, where every maximal clique is the set of a...
DM
2008
13 years 11 months ago
2008
A clique in a graph G is a complete subgraph of G. A clique covering (partition) of G is a collection C of cliques such that each edge of G occurs in at least (exactly) one clique...
DAM
2008
13 years 11 months ago
2008
Given a graph G = (V, E) and a positive integer k, the PARTITION INTO CLIQUES (PIC) decision problem consists of deciding whether there exists a partition of V into k disjoint sub...