Add to ORKGThe problem of hidden parallelism of algorithms based on theory of monotone systems is discussed. A new fast algorithm for separation of all maximal cliques on finite non-oriented graph is described. An example of algorithm’s work is presented. 1
AbstractDecompositions of a graph by clique separators are investigated which have the additional pr...
The K ` - clique transversal problem is to locate a minimum collection of cliques of size ` in a gra...
Abstract—Maximal cliques are important substructures in graph analysis. Many algorithms for computin...
[[abstract]]Naor et al. (1987) proposed parallel algorithms for several problems on chordal graphs s...
We present parallel algorithms on the BSP/CGM model, with p processors, to count and generate all t...
We present parallel algorithms on the BSP/CGM model, with p processors, to count and generate all th...
ABSTRACT. In this paper we present a portable exact parallel algorithm for the maximum clique proble...
Maximal clique enumeration and maximum clique generation are well known NP-complete discrete optimiz...
The enumeration of all maximal cliques in an undirected graph is a fundamental problem arising in se...
AbstractWe define a family of graphs, called the clique separable graphs, characterized by the fact ...
We give the first NC algorithm for finding a clique separator decomposition of a graph, that is, a ...
A minimum clique-transversal set MCT (G) of a graph G=(V; E) is a set S V of minimum cardinality tha...
This thesis is about structural and algorithmic aspects of graphs. It is divided in two parts, which...
We present a threaded parallel adaptation of a state-of-the-art maximum clique algorithm for dense, ...
The class NC consists of problems solvable very fast (in time polynomial in log n) in parallel with ...
AbstractDecompositions of a graph by clique separators are investigated which have the additional pr...
The K ` - clique transversal problem is to locate a minimum collection of cliques of size ` in a gra...
Abstract—Maximal cliques are important substructures in graph analysis. Many algorithms for computin...
[[abstract]]Naor et al. (1987) proposed parallel algorithms for several problems on chordal graphs s...
We present parallel algorithms on the BSP/CGM model, with p processors, to count and generate all t...
We present parallel algorithms on the BSP/CGM model, with p processors, to count and generate all th...
ABSTRACT. In this paper we present a portable exact parallel algorithm for the maximum clique proble...
Maximal clique enumeration and maximum clique generation are well known NP-complete discrete optimiz...
The enumeration of all maximal cliques in an undirected graph is a fundamental problem arising in se...
AbstractWe define a family of graphs, called the clique separable graphs, characterized by the fact ...
We give the first NC algorithm for finding a clique separator decomposition of a graph, that is, a ...
A minimum clique-transversal set MCT (G) of a graph G=(V; E) is a set S V of minimum cardinality tha...
This thesis is about structural and algorithmic aspects of graphs. It is divided in two parts, which...
We present a threaded parallel adaptation of a state-of-the-art maximum clique algorithm for dense, ...
The class NC consists of problems solvable very fast (in time polynomial in log n) in parallel with ...
AbstractDecompositions of a graph by clique separators are investigated which have the additional pr...
The K ` - clique transversal problem is to locate a minimum collection of cliques of size ` in a gra...
Abstract—Maximal cliques are important substructures in graph analysis. Many algorithms for computin...