148 search results - page 16 / 30 » Linear reductions of maximum matching |
FOCS
2008
IEEE
15 years 4 months ago
2008
IEEE
We study the properties of embeddings, multicommodity flows, and sparse cuts in minor-closed families of graphs which are also closed under 2-sums; this includes planar graphs, g...
ALGOSENSORS
2007
Springer
15 years 4 months ago
2007
Springer
We introduce Semi-Matching with Demands (SMD), which models a certain problem in sensor networks of assigning individual sensors to sensing tasks. If there are multiple sensing tas...
CSB
2005
IEEE
15 years 3 months ago
2005
IEEE
This work presents the development of algorithms for approximate string matching using parallel methods. It intends to do the maximum of molecular sequences comparisons per unity ...
WWW
2009
ACM
15 years 10 months ago
2009
ACM
In sponsored search, a number of advertising slots is available on a search results page, and have to be allocated among a set of advertisers competing to display an ad on the pag...
COMBINATORICA
2008
14 years 10 months ago
2008
Let NF(n, k, r) denote the maximum number of columns in an n-row matrix with entries in a finite field F in which each column has at most r nonzero entries and every k columns are...