6 search results - page 1 / 2 » Fixed-Parameter Enumerability of Cluster Editing and Related... |
137
click to vote
MST
2010
14 years 10 months ago
2010
Cluster Editing is transforming a graph by at most k edge insertions or deletions into a disjoint union of cliques. This problem is fixed-parameter tractable (FPT). Here we comput...
120
click to vote
COMBINATORICS
2004
15 years 3 months ago
2004
The basic functional equations for connected and 2-connnected graphs can be traced back to the statistical physicists Mayer and Husimi. They play an essential role in establishing...
190
click to vote
BMCBI
2007
15 years 4 months ago
2007
Background: Detecting groups of functionally related proteins from their amino acid sequence alone has been a long-standing challenge in computational genome research. Several clu...
128
click to vote
CLEF
2010
Springer
15 years 5 months ago
2010
Springer
In the third edition of WePS campaign we have undertaken the person name disambiguation problem referred to as a clustering task. Our aim was to make use of intrinsic link relation...
135
click to vote
FCCM
2007
IEEE
15 years 7 months ago
2007
IEEE
While medium- and large-sized computing centers have increasingly relied on clusters of commodity PC hardware to provide cost-effective capacity and capability, it is not clear th...