scientific article
From MaRDI portal
Publication:3727154
zbMath0595.62051MaRDI QIDQ3727154
Bernard Monjardet, Claude Le Conte de Poly-Barbut
Publication date: 1986
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
linear orderscomparability graphrankingsKendall's taupartial orderundirected graphsSpearman's rhoextremal valuesrank correlation coefficients
Measures of association (correlation, canonical correlation, etc.) (62H20) Extremal problems in graph theory (05C35)
Related Items (3)
Sur les graphes admettant le nombre maximum de sous-graphes à trois sommets et deux arêtes, et les paires d'ordres totaux qui maximisent \(| Rho\)- Tau\(|\). (On the graphs which admit the maximal number of subgraphs on three vertices and with two edges and the totally ordered pairs which maximize \(| Rho\)- Tau\(|)\) ⋮ Concordance between two linear orders: The Spearman and Kendall coefficients revisited ⋮ On the comparison of the Spearman and Kendall metrics between linear orders.
This page was built for publication:
