✦ LIBER ✦

Loop-Free Gray Code Algorithms for the Set of Compositions

✍ Scribed by Toufik Mansour; Ghalib Nassar

Publisher: Springer Netherlands
Year: 2010
Tongue: English
Weight: 302 KB
Volume: 9
Category: Article
ISSN: 1570-1166
DOI: 10.1007/s10852-010-9131-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Polynomial algorithms for the maximum st

Polynomial algorithms for the maximum stable set problem on particular classes of P5-free graphs

✍ Raffaele Mosca 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 588 KB

The Maximum Stable Set Problem (MS) is a well-known NP-hard problem. A popular research stream considers classes of graphs, defined in terms of forbidden subgraphs, in which either MS is NP-hard or can be solved by polynomial algorithms. In this paper we focus on three of these classes: in one of th

Algorithms and a set of programs for the

Algorithms and a set of programs for the analysis of EXAFS spectra. II. Normalization with respect to the absorption of the free atoms

✍ V. E. Il'in; V. M. Chermashentsev; L. N. Mazalov 📂 Article 📅 1982 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 211 KB

Coding of empirical parameters in the th

Coding of empirical parameters in the theory of vibrational spectra of polyatomic molecules and an algorithm for setting up their tables on a computer

✍ L. A. Gribov; M. A. El'yashevich 📂 Article 📅 1978 🏛 Springer US 🌐 English ⚖ 481 KB