✦ LIBER ✦

Computing the Cover Array in Linear Time

✍ Scribed by Y. Li and W. F. Smyth

Book ID: 120137109
Publisher: Springer
Year: 2002
Tongue: English
Weight: 109 KB
Volume: 32
Category: Article
ISSN: 0178-4617
DOI: 10.1007/s00453-001-0062-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The utility of the array pattern matrix

The utility of the array pattern matrix for linear array computations

✍ Hoffman, M. 📂 Article 📅 1961 🏛 IEEE 🌐 English ⚖ 306 KB

Computing the Euclidean Distance Transfo

Computing the Euclidean Distance Transform on a Linear Array of Processors

✍ Marina L. Gavrilova; Muhammad H. Alsuwaiyel 📂 Article 📅 2003 🏛 Springer US 🌐 English ⚖ 208 KB

Computing the Cutwidth of Bipartite Perm

Computing the Cutwidth of Bipartite Permutation Graphs in Linear Time

✍ Heggernes, Pinar; van 't Hof, Pim; Lokshtanov, Daniel; Nederlof, Jesper 📂 Article 📅 2012 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 283 KB

Computing the Girth of a Planar Graph in

Computing the Girth of a Planar Graph in Linear Time

✍ Chang, Hsien-Chih; Lu, Hsueh-I 📂 Article 📅 2013 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 431 KB

Adaptive Nulling in Time-Varying Scenari

Adaptive Nulling in Time-Varying Scenarios Through Time-Modulated Linear Arrays

✍ Rocca, P.; Poli, L.; Oliveri, G.; Massa, A. 📂 Article 📅 2012 🏛 IEEE 🌐 English ⚖ 975 KB

Supercomputing and grid computing on the

Supercomputing and grid computing on the verification of covering arrays

✍ Himer Avila-George, Jose Torres-Jimenez, Nelson Rangel-Valdez, Abel Carrión, Vic 📂 Article 📅 2012 🏛 Springer US 🌐 English ⚖ 974 KB