Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
SIAMDM
2010
170views more  SIAMDM 2010»
9 years 11 months ago
Complete Minors and Independence Number
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...
Jacob Fox
COCOA
2010
Springer
9 years 11 months ago
Termination of Multipartite Graph Series Arising from Complex Network Modelling
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...
Matthieu Latapy, Thi Ha Duong Phan, Christophe Cre...
CVPR
2011
IEEE
10 years 16 days ago
Inference for Order Reduction in Markov Random Fields
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...
Andrew C. Gallagher, Dhruv Batra, Devi Parikh
GC
2002
Springer
10 years 3 months ago
Ramsey-Type Results for Unions of Comparability Graphs
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...
Adrian Dumitrescu, Géza Tóth
GC
2007
Springer
10 years 4 months ago
On the Maximum Number of Cliques in a Graph
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 ...
David R. Wood
HEURISTICS
2006
120views more  HEURISTICS 2006»
10 years 4 months ago
A study of ACO capabilities for solving the maximum clique problem
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 ...
Christine Solnon, Serge Fenet
CORR
2006
Springer
110views Education» more  CORR 2006»
10 years 4 months ago
The topology of covert conflict
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...
Shishir Nagarja
ENDM
2008
90views more  ENDM 2008»
10 years 4 months ago
On cliques of Helly Circular-arc Graphs
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...
Min Chih Lin, Ross M. McConnell, Francisco J. Soul...
DM
2008
145views more  DM 2008»
10 years 4 months ago
Clique coverings and partitions of line graphs
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...
Bo-Jr Li, Gerard J. Chang
DAM
2008
131views more  DAM 2008»
10 years 4 months ago
Partition into cliques for cubic graphs: Planar case, complexity and approximation
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...
Márcia R. Cerioli, L. Faria, T. O. Ferreira...
books