30 search results - page 5 / 6 » dam 2000 |
DAM
2008
13 years 5 months ago
2008
The maximum number of edges spanned by a subset of given diameter in a Hamming space with alphabet size at least three is determined. The binary case was solved earlier by Ahlswed...
DAM
2000
13 years 4 months ago
2000
This paper deals with facility location problems with pos=neg weights in trees. We consider two di erent objective functions which model two di erent ways to handle obnoxious faci...
DAM
2000
13 years 4 months ago
2000
The linear-width of a graph G is de ned to be the smallest integer k such that the edges of G can be arranged in a linear ordering e1;:::;er in such a way that for every i = 1;:::...
DAM
2000
13 years 4 months ago
2000
Feedback problems consist of removing a minimal number of vertices of a directed or undirected graph in order to make it acyclic. The problem is known to be NPcomplete. In this pa...
SPIN
2000
Springer
13 years 8 months ago
2000
Springer
Abstract. We give a detailed description of SymmSpin, a symmetryreduction package for Spin. It o ers four strategies for state-space reduction, based on the heuristic that we prese...