1977 search results - page 60 / 396 » The satisfactory partition problem |
131
click to vote
RECOMB
2001
Springer
16 years 6 months ago
2001
Springer
Recent studies (Alizadeh et al, [1]; Bittner et al,[5]; Golub et al, [11]) demonstrate the discovery of putative disease subtypes from gene expression data. The underlying computa...
138
click to vote
4OR
2007
15 years 6 months ago
2007
Abstract We show that a well-known linearization technique initially proposed for quadratic assignment problems can be generalized to a broader class of quadratic 0-1 mixed-integer...
190
click to vote
CORR
1999
Springer
15 years 5 months ago
1999
Springer
We solve the subgraph isomorphism problem in planar graphs in linear time, for any pattern of constant size. Our results are based on a technique of partitioning the planar graph ...
151
click to vote
EOR
2010
15 years 6 months ago
2010
In the Attractive Traveling Salesman Problem the vertex set is partitioned into facility vertices and customer vertices. A maximum profit tour must be constructed on a subset of t...
132
click to vote
ENDM
2000
15 years 5 months ago
2000
A graph is a 1-join composition if its vertex set can be partitioned into four nonempty sets AL; AR; SL and SR such that: every vertex of AL is adjacent to every vertex of AR; no ...