Keyword: cliques

Found 8 papers in total
Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations
Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations
2013,
Given a simple undirected graph, the problem of finding a maximum subset of vertices...
Algorithms for recognizing bipartite‐Helly and bipartite‐conformal hypergraphs
Algorithms for recognizing bipartite‐Helly and bipartite‐conformal hypergraphs
2011,
A hypergraph is Helly if every family of hyperedges of it, formed by pairwise...
Computing the Grothendieck constant of some graph classes
Computing the Grothendieck constant of some graph classes
2011,
The Grothendieck constant κ ( G ) of a graph G = ( [ n ] , E ) is the...
A fast algorithm to remove proper and homogeneous pairs of cliques (while preserving some graph invariants)
A fast algorithm to remove proper and homogeneous pairs of cliques (while preserving some graph invariants)
2011,
We introduce a family of reductions for removing proper and homogeneous pairs of...
Graph‐based data clustering with overlaps
Graph‐based data clustering with overlaps
2011,
We introduce overlap cluster graph modification problems where, other than in most...
Clique-connecting forest and stable set polytopes
Clique-connecting forest and stable set polytopes
2010,
Let G=(V,E) be a simple undirected graph. A forest F of G is said to be...
On tightening cover induced inequalities
On tightening cover induced inequalities
1992,
Here the authors describe computationally efficient procedures for tightening cover...
Clique covering and clique partition in generalizations of line graphs
Clique covering and clique partition in generalizations of line graphs
1995,
Cliques are complete subgraphs of a graph. This note shows that minimum sets of...
Papers per page: