1105 search results - page 173 / 221 » Linear choosability of graphs |
DISOPT
2008
14 years 12 months ago
2008
At present, the most successful approach to solving large-scale instances of the Symmetric Traveling Salesman Problem to optimality is branch-and-cut. The success of branch-and-cu...
ARSCOM
2006
14 years 12 months ago
2006
The posets of dimension 2 are those posets whose minimal realizations have two elements, that is, which may be obtained as the intersection of two of their linear extensions. Gall...
CORR
2006
Springer
14 years 12 months ago
2006
Springer
Abstract. In the first part of this paper we present a theory of proof nets for full multiplicative linear logic, including the two units. It naturally extends the well-known theor...
113
click to vote
CORR
2007
Springer
14 years 12 months ago
2007
Springer
In recent years, spectral clustering has become one of the most popular modern clustering algorithms. It is simple to implement, can be solved efficiently by standard linear algeb...
JSA
2008
14 years 12 months ago
2008
In this paper, we present linear processor array architectures for flexible approximate string matching. These architectures are based on parallel realization of dynamic programmi...