DAM
2006
13 years 11 months ago
2006
A floorplan represents the relative relations between modules on an integrated circuit. Floorplans are commonly classified as slicing, mosaic, or general. Separable and Baxter per...
DAM
2006
13 years 11 months ago
2006
All binary projective codes of dimension up to 6 are classified. Information about the number of the codes with different minimum distances and different orders of automorphism gro...
DAM
2006
13 years 11 months ago
2006
Motivated by issues in machine learning and statistical pattern classification, we investigate a class cover problem (CCP) with an associated family of directed graphs--class cove...
DAM
2006
13 years 11 months ago
2006
A graph theoretical model is presented for constructing calendars for sports leagues where balancing requirement have to be considered with respect to the different venues where c...
DAM
2006
13 years 11 months ago
2006
A t-packing is an ordered pair (V, P) where V is a v-set and P is a collection of k-subsets (blocks) of V such that each t-subset of V occurs in at most one block of P. If each t-...
DAM
2006
13 years 11 months ago
2006
We observe that a formula given by S. Negami [Trans. Amer. Math. Soc. 299 (1987), 601-622] for the Tutte polynomial of a k-sum of two graphs generalizes to a colored Tutte polynom...
DAM
2006
13 years 11 months ago
2006
DAM
2006
13 years 11 months ago
2006
Abstract. Artin's braid groups currently provide a promising background for cryptographical applications, since the first cryptosystems using braids were introduced in [2, 3, ...
DAM
2006
13 years 11 months ago
2006
In the precoloring extension problem we are given a graph with some of the vertices having a preassigned color and it has to be decided whether this coloring can be extended to a ...
DAM
2006
13 years 11 months ago
2006
The characterization of ideal access structures and the search for bounds on the optimal information rate are two important problems in secret sharing. These problems are studied ...