Search

Search Results

1. On Coloring of Sparse Graphs

   Graph coloring has numerous applications and is a well-known NP-complete problem. The goal of this paper is to survey recent results of the authors...

   Alexandr Kostochka, Matthew Yancey in Computer Science – Theory and Applications

   Conference paper 2013
   

2. Optimal constant weight covering codes and nonuniform group divisible 3-designs with block size four

   Let K _q ( n , w , t , d ) be the minimum size of a code over Z _q of length n , constant weight w , such that every word with weight t is within Hamming...

   **ande Zhang, Hui Zhang, Gennian Ge in Designs, Codes and Cryptography

   Article 03 April 2011

3. Adjacency matrices of polarity graphs and of other C ₄-free graphs of large size

   In this paper we give a method for obtaining the adjacency matrix of a simple polarity graph G _q from a projective plane PG (2, q ), where q is a prime...

   M. Abreu, C. Balbuena, D. Labbate in Designs, Codes and Cryptography

   Article 07 February 2010

4. Forbidden (0,1)-vectors in Hyperplanes of \(\mathbb{R}^{n}\): The unrestricted case

   In this paper, we continue our investigation on “Extremal problems under dimension constraints” introduced [1]. The general problem we deal with in...

   R. Ahlswede, H. Aydinian, L. H. Khachatrian in Designs, Codes and Cryptography

   Article 01 October 2005

5. Forbidden (0,1)-Vectors in Hyperplanes of ℝ ⁿ : The Restricted Case

   In this paper we continue our investigation on “Extremal problems under dimension constraint” introduced in [2].

   Let E ( n , k ) be the set of...

   R. Ahlswede, H. Aydinian, L. H. Khachatrian in Designs, Codes and Cryptography

   Article 01 May 2003

6. Cone Dependence—A Basic Combinatorial Concept

   Rudolf Ahlswede, Levon Khachatrian in Designs, Codes and Cryptography

   Article 01 May 2003

7. An orthogonal systolic array for the algebraic path problem

   This paper is devoted to the design of an orthogonal systolic array of n ( n +1) elementary processors which can solve any instance of the Algebraic Path...

   Y. Robert, D. Trystram in Computing

   Article 01 September 1987

8. A systolic array algorithm for the algebraic path problem (shortest paths; Matrix inversion)

   It is shown how the Gauß-Jordan Elimination algorithm for the Algebraic Path Problem can be implemented on a hexagonal systolic array of a quadratic...

   Günter Rote in Computing

   Article 01 September 1985