280 search results - page 2 / 56 » New Algorithms for Enumerating All Maximal Cliques |
ISAAC
1997
Springer
13 years 9 months ago
1997
Springer
ESA
2005
Springer
13 years 11 months ago
2005
Springer
Abstract. We provide new tools, such as k-troikas and good subtreerepresentations, that allow us to give fast and simple algorithms computing branchwidth. We show that a graph G ha...
ALMOB
2006
13 years 5 months ago
2006
Given a set S of n locally aligned sequences, it is a needed prerequisite to partition it into groups of very similar sequences to facilitate subsequent computations, such as the ...
STACS
2007
Springer
13 years 11 months ago
2007
Springer
We contribute to the study of efficient enumeration algorithms for all solutions of constraint satisfaction problems. The only algorithm known so far, presented by Creignou and H´...
FIMI
2003
13 years 7 months ago
2003
We describe an implementation of an algorithm for enumerating all maximal frequent sets using irredundant dualization, which is an improved version of that of Gunopulos et al. The...