2069 search results - page 102 / 414 » Linear time algorithms for Clobber |
174
click to vote
ALGORITHMICA
2011
14 years 11 months ago
2011
We consider the problem of computing efficient strategies for searching in trees. As a generalization of the classical binary search for ordered lists, suppose one wishes to find...
118
Voted
MMAS
2010
Springer
14 years 11 months ago
2010
Springer
The two-dimensional layout optimization problem reinforced by the efficient space utilization demand has a wide spectrum of practical applications. Formulating the problem as a non...
165
click to vote
STACS
2010
Springer
15 years 11 months ago
2010
Springer
Abstract. The problem of Subgraph Isomorphism is defined as follows: Given a pattern H and a host graph G on n vertices, does G contain a subgraph that is isomorphic to H? Eppstei...
151
click to vote
SODA
2010
ACM
16 years 1 months ago
2010
ACM
Many NP-hard problems can be solved efficiently when the input is restricted to graphs of bounded tree-width or clique-width. In particular, by the celebrated result of Courcelle,...
155
click to vote
STOC
2009
ACM
16 years 4 months ago
2009
ACM
Linear programming decoding for low-density parity check codes (and related domains such as compressed sensing) has received increased attention over recent years because of its p...