1201 search results - page 168 / 241 » Linear Probing and Graphs |
135
click to vote
PODC
2009
ACM
16 years 1 months ago
2009
ACM
The paper presents distributed and parallel -approximation algorithms for covering problems, where is the maximum number of variables on which any constraint depends (for example...
110
click to vote
CIAC
2010
Springer
15 years 10 months ago
2010
Springer
In this paper we consider a natural generalization of the well-known Max Leaf
Spanning Tree problem. In the generalized Weighted Max Leaf problem we get as
input an undirected co...
100
click to vote
WWW
2010
ACM
15 years 7 months ago
2010
ACM
We consider the problem of deep web source selection and argue that existing source selection methods are inadequate as they are based on local similarity assessment. Specificall...
116
Voted
WADS
2009
Springer
15 years 7 months ago
2009
Springer
We consider the pair (pi, fi) as a force with two-dimensional direction vector fi applied at the point pi in the plane. For a given set of forces we ask for a non-crossing geometri...
CSL
2009
Springer
15 years 7 months ago
2009
Springer
One of Courcelle’s celebrated results states that if C is a class of graphs of bounded tree-width, then model-checking for monadic second order logic (MSO2) is fixed-parameter t...