2069 search results - page 139 / 414 » Linear time algorithms for Clobber |
120
click to vote
GD
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. A graph is planar if and only if it does not contain a Kuratowski subdivision. Hence such a subdivision can be used as a witness for non-planarity. Modern planarity testi...
120
click to vote
ECCC
2007
15 years 4 months ago
2007
Algorithmic meta theorems are algorithmic results that apply to whole families of combinatorial problems, instead of just specific problems. These families are usually defined i...
150
click to vote
ICIP
2006
IEEE
16 years 6 months ago
2006
IEEE
Compressive Sensing is an emerging field based on the revelation that a small group of non-adaptive linear projections of a compressible signal contains enough information for rec...
130
click to vote
SODA
2000
ACM
15 years 5 months ago
2000
ACM
We discuss the problem of optimally "finishing" a partially sequenced, reconstructed DNA segment. At first sight, this appears to be computationally hard. We construct a...
139
click to vote
ALENEX
2007
15 years 6 months ago
2007
We consider the problem of designing a distributed algorithm that, given an arbitrary connected graph G of nodes with unique labels, converts G into a sorted list of nodes. This a...