Refined Deterministic Algorithm for Biplane Construction

Martinjak, Ivica; Pavčević, Mario-Osvin
March 2010
Journal of Computing & Information Technology;Mar2010, Vol. 18 Issue 1, p45
Academic Journal
This paper introduces a way of constructing biplanes that uses "filters" in a step prior to an exhaustive computer search, with the objective to make the biplane construction more efficient. The achieved deterministic algorithm classifies biplanes of order 7 and smaller. When performing the search using some additional presumptive conditions, two biplanes of order 9 (k = 11) were constructed and a particular inner regularity in the biplane's structure has been established.


Related Articles

  • Classification of Triangle-Free 223 Configurations. Al-Azemi, Abdullah; Betten, Anton // International Journal of Combinatorics;2010, Vol. 2010, p1 

    The article focuses on the classification of triangle-free 223 configurations using computer search. It states that a configuration can only be considered triangle-free if the girth of the incident graph is not less than 8. It says that the algorithm from 12, 13 was use to ensure that all the...

  • Directed figure codes are decidable. Kolarz, Michal; Moczurad, Wlodzimierz // Discrete Mathematics & Theoretical Computer Science (DMTCS);2009, Vol. 11 Issue 2, p1 

    Two-dimensional structures of various kinds can be viewed as generalizations of words. Codicity verification and the defect effect, important properties related to word codes, are studied also in this context. Unfortunately, both are lost in the case of two common structures, polyominoes and...

  • Tiling Periodicity. Karhumäki, Juhani; Lifshits, Yury; Rytter, Wojciech // Discrete Mathematics & Theoretical Computer Science (DMTCS);Mar2010, Vol. 12 Issue 2, p237 

    We contribute to combinatorics and algorithmics of words by introducing new types of periodicities in words. A tiling period of a word w is partial word u such that w can be decomposed into several disjoint parallel copies of u, e.g. a â—Š b is a tiling period of aabb. We investigate...

  • Computer Simulation-based Optimization: Hybrid Branch & Bound and Orthogonal Array based Enumeration Algorithm. Gadallah, Mohamed H. // World Congress on Engineering 2009 (Volume 1);2009, p610 

    We propose a new modified algorithm for the Branch and Bound method. This method is based on integration of orthogonal arrays and enumeration based techniques. Several observations are given supplemented with simple model solutions to verify our assumptions. The modified algorithm is valid for...

  • Embedding Partial 4-cycle Systems of Arbitrary Index. Parker, April; Rodger, C. A. // Graphs & Combinatorics;Nov2008, Vol. 24 Issue 4, p367 

    Recently, Lindner showed that every partial 4-cycle system of order n and index 1 could be embedded in a 4-cycle system of order ν and index 1 with v ≤ 2 n + 15. While the technique he used does not immediately extend to any higher index, here we develop his ideas to show that every...

  • The Deutsch-Josza's Algorithm for n-qudits. Mogoş, Gabriela // International Journal of Computers, Communications & Control;2008 Supplement, Vol. 3 Issue 3, p393 

    Deutsch-Josza's algorithm, as all known quantum algorithms that provide exponential speedup over classical systems do, answers a question about a global property of a solution space. This paper describes the generalization of the Deutsch-Josza algorithm to n d-dimensional quantum systems or qudits.

  • AN ALGORITHM FOR CONSTRUCTING SYMMETRIC ((r+1)v, kr, kλ) BIBDs FROM AFFINE RESOLVABLE (v, b, r, k, λ) BIBDs. Osuolale, Kazeem A.; Otekunrin, Oluwaseun A. // Annals. Computer Science Series;2014, Vol. 12 Issue 2, p49 

    This work deals with the construction of symmetric ((r+1)v, kr, kλ) BIBDs from affine resolvable (v, b, r, k, λ) BIBDs. A MATLAB program was written to construct resolution and parallel classes from ((4, 6, 3, 2, 1) and (9, 12, 4, 3, 1) affine resolvable designs. A technique was thereafter...

  • Matroids: The Theory and Practice of Greed. Jones, Christian; Libeskind-Hadas, Ran // UMAP Journal;2001/2002 Modules, Vol. 22, p39 

    The article presents information on a mathematical structure called a matroid which is used to construct so-called greedy algorithms for discrete optimization problems. Matroids can also be used to develop efficient algorithms for even more complicated optimization problems where simple greedy...

  • The delivery man problem and cumulative matroids. Fischetti, Matteo; Laporte, Gilbert // Operations Research;Nov/Dec93, Vol. 41 Issue 6, p1055 

    Given a complete directed graph G = (V, A), the delivery man problem (DMP) consists of determining a Hamiltonian circuit minimizing the sum of distances (along the circuit) from a given vertex v1, to every vertex of V, including v1 itself. There exists a number of applications of the DMP in the...


Read the Article


Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics