1951 search results - page 46 / 391 » An algorithm for improving graph partitions |
FCT
2005
Springer
15 years 3 months ago
2005
Springer
108
click to vote
CATS
2006
14 years 11 months ago
2006
We consider the following clustering problems: given a general undirected graph, partition its vertices into disjoint clusters such that each cluster forms a clique and the number...
APPROX
2007
Springer
15 years 4 months ago
2007
Springer
WABI
2007
Springer
15 years 4 months ago
2007
Springer
Predicting the secondary structure of an RNA sequence is an important problem in structural bioinformatics. The general RNA folding problem, where the sequence to be folded may con...
AMAI
2004
Springer
15 years 3 months ago
2004
Springer
We study three new techniques which will speed up the branch-and-bound algorithm for the MAX-2-SAT problem: The first technique is a new lower bound function for the algorithm an...