✦ LIBER ✦

Almost all webs are not rank-perfect

✍ Scribed by Arnaud Pêcher; Annegret K. Wagler

Publisher: Springer-Verlag
Year: 2005
Tongue: English
Weight: 270 KB
Volume: 105
Category: Article
ISSN: 0025-5610
DOI: 10.1007/s10107-005-0655-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Perfectly orderable graphs and almost al

Perfectly orderable graphs and almost all perfect graphs are kernelM-solvable

✍ Mostafa Blidia; Konrad Engel 📂 Article 📅 1992 🏛 Springer Japan 🌐 English ⚖ 273 KB

The method of m rankings when the number

The method of m rankings when the numbers of observations in each cell are not all unity

✍ T.P. Hutchinson 📂 Article 📅 1977 🏛 Elsevier Science 🌐 English ⚖ 834 KB

The nonparametric procedure known as Friedman's test is often used when we have one observation in each cell of a two-way table. Some time ago, Benard and van Elteren generalized this "method of m rankings" to tables containing arbitrary numbers of observations per cell, though their work apparently