✦ LIBER ✦

Backtracking algorithm for finding t-designs

✍ Scribed by M. M-Noori; B. Tayfeh-Rezaie

Publisher: John Wiley and Sons
Year: 2003
Tongue: English
Weight: 103 KB
Volume: 11
Category: Article
ISSN: 1063-8539
DOI: 10.1002/jcd.10045

No coin nor oath required. For personal study only.

✦ Synopsis

Abstract

A detailed description of an improved version of backtracking algorithms for finding t‐designs proposed by G. B. Khosrovshahi and the authors of this paper [J Combin Designs 10 (2002), 180–194] is presented. The algorithm is then used to determine all 5‐(14,6,3) designs admitting an automorphism of order 13, 11, or 7. It is concluded that a 5‐(14,6,3) design with an automorphism of prime order p exists if and only if p=2,3,7,13. © 2003 Wiley Periodicals, Inc. J Combin Designs 11: 240–248, 2003; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/jcd.10045

📜 SIMILAR VOLUMES

Finding simple t-designs with enumeratio

Finding simple t-designs with enumeration techniques

✍ Alfred Wassermann 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 168 KB

Lattice basis reduction in combination with an efficient backtracking algorithm is used to find all (4 996 426) simple 7-(33,8,10) designs with automorphism group PΓL(2, 32).

An algorithm for finding closed curves

✍ Ming Xie; Monique Thonnat 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 900 KB

Inequalities for t designs

✍ Richard M Wilson 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 489 KB

An algorithm for optimization of block d

An algorithm for optimization of block designs

✍ Tue Tjur 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 384 KB

An algorithm for A-optimal regression de

An algorithm for A-optimal regression designs

✍ Kim-Hung Li; N.N. Chan 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 466 KB

A Stabilizing Algorithm for Finding Bico

A Stabilizing Algorithm for Finding Biconnected Components

✍ Mehmet Hakan Karaata 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 209 KB

In this paper, a self-stabilizing algorithm is presented for finding biconnected components of a connected undirected graph on a distributed or network model of computation. The algorithm is resilient to transient faults, therefore, it does not require initialization. The proposed algorithm is based