2069 search results - page 31 / 414 » Linear time algorithms for Clobber |
114
click to vote
SAS
2004
Springer
15 years 9 months ago
2004
Springer
We describe a polynomial-time algorithm for global value numbering, which is the problem of discovering equivalences among program sub-expressions. We treat all conditionals as non...
133
Voted
COCOON
2005
Springer
15 years 9 months ago
2005
Springer
We study the edge-connectivity survivable network design problem with an additional linear budget constraint. We give a strongly polynomial time (3, 3)-approximation algorithm for ...
128
click to vote
JACM
2010
15 years 2 months ago
2010
We present a linear expected time algorithm for finding maximum cardinality matchings in sparse random graphs. This is optimal and improves on previous results by a logarithmic f...