From rankings’ collinearity to counting SDR's via chromatic list expression

DOI10.1080/00207160701828090zbMath1175.05055OpenAlexW2109424576MaRDI QIDQ3396413

Ioan Tomescu, Liviu P. Dinu

Publication date: 18 September 2009

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207160701828090

zbMATH Keywords

rank distancesystem of distinct representatives\(L\)-coloringchromatic list expressioncollinearity condition

Mathematics Subject Classification ID

Combinatorics on words (68R15) Coloring of graphs and hypergraphs (05C15) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Cites Work

• An efficient approach for the rank aggregation problem
• Handbook of Graph Theory

This page was built for publication: From rankings’ collinearity to counting SDR's via chromatic list expression