6 search results - page 1 / 2 » A Tight Analysis of the Maximal Matching Heuristic |
COCOON
2005
Springer
15 years 3 months ago
2005
Springer
We study the worst-case performance of the maximal matching heuristic applied to the Minimum Vertex Cover and Minimum Maximal Matching problems, through a careful analysis of tigh...
83
Voted
KDD
2009
ACM
15 years 10 months ago
2009
ACM
Influence maximization is the problem of finding a small subset of nodes (seed nodes) in a social network that could maximize the spread of influence. In this paper, we study the ...
105
click to vote
DAGSTUHL
2006
14 years 11 months ago
2006
An algorithm that discovers the themes, motives and other perceptually significant repeated patterns in a musical work can be used, for example, in a music information retrieval sy...
CC
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. Xtatic is a lightweight extension of C offering native support for statically typed XML processing. XML trees are built-in values in Xtatic, and static analysis of the t...
67
Voted
TSE
2008
14 years 9 months ago
2008
Neglected conditions are an important but difficult-to-find class of software defects. This paper presents a novel approach for revealing neglected conditions that integrates stati...