500 search results - page 25 / 100 » Approximation algorithms for maximum independent set of pseu... |
114
click to vote
WABI
2007
Springer
15 years 7 months ago
2007
Springer
Abstract. Protein structural alignment is an indispensable tool used for many different studies in bioinformatics. Most structural alignment algorithms assume that the structural ...
112
Voted
AAAI
2010
15 years 3 months ago
2010
We consider approval voting elections in which each voter votes for a (possibly empty) set of candidates and the outcome consists of a set of k candidates for some parameter k, e....
127
click to vote
WAOA
2005
Springer
15 years 7 months ago
2005
Springer
A cycle cover of a graph is a set of cycles such that every vertex is part of exactly one cycle. An L-cycle cover is a cycle cover in which the length of every cycle is in the set...
123
click to vote
CPM
2000
Springer
15 years 6 months ago
2000
Springer
We study Hamming versions of two classical clustering problems. The Hamming radius p-clustering problem (HRC) for a set S of k binary strings, each of length n, is to find p bina...
122
click to vote
AICCSA
2007
IEEE
15 years 8 months ago
2007
IEEE
In the maximum common subgraph (MCS) problem, we are given a pair of graphs and asked to find the largest induced subgraph common to them both. With its plethora of applications,...