1963 search results - page 194 / 393 » The Maximum Solution Problem on Graphs |
145
click to vote
SIAMCOMP
1998
15 years 2 months ago
1998
This paper introduces a near-linear time sequential algorithm for constructing a sparse neighborhood cover. This implies analogous improvements (from quadratic to near-linear time)...
130
click to vote
COMBINATORICA
2008
15 years 3 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...
111
click to vote
SIAMJO
2010
15 years 1 months ago
2010
Inspired by a question of Lov´asz, we introduce a hierarchy of nested semidefinite relaxations of the convex hull of real solutions to an arbitrary polynomial ideal, called theta...
135
click to vote
ICCAD
2000
IEEE
15 years 7 months ago
2000
IEEE
— Sub-micron feature sizes have resulted in a considerable portion of power to be dissipated on the buses, causing an increased attention on savings for power at the behavioral l...
150
click to vote
SPDP
1991
IEEE
15 years 6 months ago
1991
IEEE
The parallel genetic algorithm (PGA) is a prototype of a new kind of a distributed algorithm. It is based on a parallel search by individuals all of which have the complete proble...