✦ LIBER ✦

Balanced 0, ±1 Matrices II. Recognition Algorithm

✍ Scribed by Michele Conforti; Gérard Cornuéjols; Ajai Kapoor; Kristina Vušković

Publisher: Elsevier Science
Year: 2001
Tongue: English
Weight: 232 KB
Volume: 81
Category: Article
ISSN: 0095-8956
DOI: 10.1006/jctb.2000.2011

No coin nor oath required. For personal study only.

✦ Synopsis

In this paper we give a polynomial time recognition algorithm for balanced 0, \1 matrices. This algorithm is based on a decomposition theorem proved in a companion paper.

📜 SIMILAR VOLUMES

Balanced 0, ±1 Matrices I. Decomposition

✍ Michele Conforti; Gérard Cornuéjols; Ajai Kapoor; Kristina Vušković 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 287 KB

A 0, \1 matrix is balanced if, in every square submatrix with two nonzero entries per row and column, the sum of the entries is a multiple of four. This paper extends the decomposition of balanced 0, 1 matrices obtained by Conforti, Cornue jols, and Rao (1999, J. Combin. Theory Ser. B 77, 292 406) t

Highly resolved electronic absorption an

Highly resolved electronic absorption and luminescence spectra of some phenanthrolines in Shpolskii matrices: Part II. Fluorescence and S1←S0 absorption spectra

✍ H. Basara 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 551 KB