✦ LIBER ✦

A problem of arrangements on chessboards and generalizations

✍ Scribed by Ch.A. Charalambides

Publisher: Elsevier Science
Year: 1979
Tongue: English
Weight: 471 KB
Volume: 27
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(79)90108-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On a problem of Zalcman and its generali

On a problem of Zalcman and its generalizations

✍ V. V. Volchkov 📂 Article 📅 1993 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 288 KB

Solution of the knight's Hamiltonian pat

Solution of the knight's Hamiltonian path problem on chessboards

✍ Axel Conrad; Tanja Hindrichs; Hussein Morsy; Ingo Wegener 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 658 KB

On a problem concerning generalizations

On a problem concerning generalizations of realcompact spaces

✍ Peter Fletcher; Hans-Peter Künzi 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 448 KB

On the number of reachable configuration

On the number of reachable configurations for the chessboard pebbling problem

✍ Charles Knessl 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 339 KB

Some generalizations of the steiner prob

Some generalizations of the steiner problem in graphs

✍ C. W. Duin; A. Volgenant 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 562 KB

The Steiner Problem in Graphs (SP) is the problem of finding a set of edges with minimum total weight which connects a given subset of nodes in an edge-weighted (undirected) graph. In the more general Node-weighted Steiner Problem (NSP) also node weights are considered. A restricted minimum spanning

Conical algorithms for solving a concave

Conical algorithms for solving a concave programming problem and some generalizations

✍ S.L. Utkin; V.R. Khachaturov; H. Tuy 📂 Article 📅 1988 🏛 Elsevier Science ⚖ 490 KB