252 search results - page 2 / 51 » Decremental Clique Problem |
DBPL
1995
Springer
13 years 9 months ago
1995
Springer
We study the problem of maintaining recursively-de ned views, such as the transitive closure of a relation, in traditional relational languages that do not have recursion mechanis...
DAWAK
2005
Springer
13 years 11 months ago
2005
Springer
Data mining and machine learning must confront the problem of pattern maintenance because data updating is a fundamental operation in data management. Most existing data-mining alg...
CATS
2008
13 years 6 months ago
2008
The problem of deciding whether the edge-set of a given graph can be partitioned into at most k cliques is well known to be NP-complete. In this paper we investigate this problem ...
STOC
2002
ACM
14 years 5 months ago
2002
ACM
We present improved algorithms for maintaining transitive closure and all-pairs shortest paths/distances in a digraph under deletion of edges. For the problem of transitive closur...
SWAT
1994
Springer
13 years 9 months ago
1994
Springer
A graph is distance-hereditary if and only if each cycle on five or more vertices has at least two crossing chords. We present linear time algorithms for the minimum r-dominating c...