AbstractWe provide simple, faster algorithms for the detection of cliques and dominating sets of fixed order. Our algorithms are based on reductions to rectangular matrix multiplication. We also describe an improved algorithm for diamonds detection
International audienceThe problems of determining the minimum-sized identifying, locating-dominating...
In this work, we use algebraic methods for studying distance computation and subgraph detection task...
Abstract. Data reduction by polynomial-time preprocessing is a core concept of (parameterized) compl...
AbstractWe provide simple, faster algorithms for the detection of cliques and dominating sets of fix...
We handle in this paper three dominating clique problems, namely, the decision problem to detect whe...
We handle in this paper three dominating clique problems, namely, the decision problem itself when o...
Listing dense subgraphs is a fundamental task with a variety of network analytics applications. A lo...
We design fast exact algorithms for the problem of computing a minimum dominating set in undirected ...
This thesis examines the devices employed by various algorithms to search for maximal complete subgr...
AbstractA subset of vertices D⊆V of a graph G=(V,E) is a dominating clique if D is a dominating set ...
AbstractThe measure and conquer approach has proven to be a powerful tool to analyse exact algorithm...
International audienceThe first output-sensitive algorithm for the Maximal Clique Listing problem wa...
In this talk, we discuss the parameterized complexity of approximating the k-Dominating Set problem,...
AbstractA chordal graph has a dominating clique iff it has diameter at most 3. A strongly chordal gr...
Dealing with the NP-complete Dominating Set problem on graphs, we demonstrate the power of data redu...
International audienceThe problems of determining the minimum-sized identifying, locating-dominating...
In this work, we use algebraic methods for studying distance computation and subgraph detection task...
Abstract. Data reduction by polynomial-time preprocessing is a core concept of (parameterized) compl...
AbstractWe provide simple, faster algorithms for the detection of cliques and dominating sets of fix...
We handle in this paper three dominating clique problems, namely, the decision problem to detect whe...
We handle in this paper three dominating clique problems, namely, the decision problem itself when o...
Listing dense subgraphs is a fundamental task with a variety of network analytics applications. A lo...
We design fast exact algorithms for the problem of computing a minimum dominating set in undirected ...
This thesis examines the devices employed by various algorithms to search for maximal complete subgr...
AbstractA subset of vertices D⊆V of a graph G=(V,E) is a dominating clique if D is a dominating set ...
AbstractThe measure and conquer approach has proven to be a powerful tool to analyse exact algorithm...
International audienceThe first output-sensitive algorithm for the Maximal Clique Listing problem wa...
In this talk, we discuss the parameterized complexity of approximating the k-Dominating Set problem,...
AbstractA chordal graph has a dominating clique iff it has diameter at most 3. A strongly chordal gr...
Dealing with the NP-complete Dominating Set problem on graphs, we demonstrate the power of data redu...
International audienceThe problems of determining the minimum-sized identifying, locating-dominating...
In this work, we use algebraic methods for studying distance computation and subgraph detection task...
Abstract. Data reduction by polynomial-time preprocessing is a core concept of (parameterized) compl...
DOI
Add to ORKG