5100 search results - page 541 / 1020 » The Linear Complexity of a Graph |
194
click to vote
WEA
2007
Springer
16 years 29 days ago
2007
Springer
For trunk packing problems only few approximation schemes are known, mostly designed for the European standard DIN 70020 [6] with equally sized boxes [8, 9, 11, 12]. In this paper ...
214
Voted
CSB
2005
IEEE
16 years 15 days ago
2005
IEEE
The increasing availability of interaction graphs requires new resource-efficient tools capable of extracting valuable biological knowledge from these networks. In this paper we ...
184
Voted
CP
2005
Springer
16 years 12 days ago
2005
Springer
Abstract. We present a parameterized approximation scheme for distributed combinatorial optimization problems based on dynamic programming. The algorithm is a utility propagation m...
196
Voted
CPM
2005
Springer
16 years 12 days ago
2005
Springer
In this paper we propose new solution methods for designing tag sets for use in universal DNA arrays. First, we give integer linear programming formulations for two previous formal...
219
Voted
INEX
2005
Springer
16 years 11 days ago
2005
Springer
Self-Organizing Maps capable of encoding structured information will be used for the clustering of XML documents. Documents formatted in XML are appropriately represented as graph ...