252 search results - page 11 / 51 » Decremental Clique Problem |
154
click to vote
DAM
2008
15 years 5 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...
152
click to vote
TCS
1998
15 years 5 months ago
1998
In this paper we propose a uniform approach to deal with incremental problems on digraphs and with decremental problems on dags generalizing a technique used by La Poutr´e and va...
153
click to vote
DNA
2001
Springer
15 years 10 months ago
2001
Springer
Abstract. The goal of this research is to improve the programmability of DNA-based computers. Novel clockable microreactors can be connected in various ways to solve combinatorial ...
193
click to vote
SWAT
2010
Springer
15 years 10 months ago
2010
Springer
We consider the problem of partitioning the set of vertices of a given unit disk graph (UDG) into a minimum number of cliques. The problem is NP-hard and various constant factor a...
186
click to vote
CPM
2006
Springer
15 years 9 months ago
2006
Springer
For two strings a, b, the longest common subsequence (LCS) problem consists in comparing a and b by computing the length of their LCS. In a previous paper, we defined a generalisat...