DAM
2008
13 years 11 months ago
2008
In this paper we give a construction of T-shift synchronization codes, i.e. block codes capable of correcting synchronization shifts of length at most T in either direction (left ...
DAM
2008
13 years 11 months ago
2008
In this paper, we present new structural results about the existence of a subgraph where the degrees of the vertices are pre-specified. Further, we use these results to prove a 16...
DAM
2008
13 years 11 months ago
2008
DAM
2008
13 years 11 months ago
2008
Abstract. In many clustering systems (hierarchies, pyramids and more generally weak hierarchies) clusters are generated by two elements only. This paper is devoted to such clusteri...
DAM
2008
13 years 11 months ago
2008
The R
DAM
2008
13 years 11 months ago
2008
Let G = (V + s, E) be a 2-edge-connected graph with a designated vertex s. A pair of edges rs, st is called admissible if splitting off these edges (replacing rs and st by rt) pre...
DAM
2008
13 years 11 months ago
2008
DAM
2008
13 years 11 months ago
2008
A clique-transversal of a graph G is a subset of vertices that meets all the cliques of G. A clique-independent set is a collection of pairwise vertex-disjoint cliques. The clique...
DAM
2008
13 years 11 months ago
2008
We prove that binary decision diagrams [1] can be polynomially simulated by the extended resolution rule of [2]. More precisely, for any unsatisfiable formula , there exists an ex...
DAM
2008
13 years 11 months ago
2008
