A Graph Theoretical Approach to Handicap Ranking of Tournaments and Paired Comparisons

DOI10.1137/0601041zbMATH Open0499.05028OpenAlexW2043190879MaRDI QIDQ3964593FDOQ3964593

Authors: Kenneth A. Berman 

Publication date: 1980

Published in: SIAM Journal on Algebraic Discrete Methods (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0601041

zbMATH Keywords

round-robin tournamentshandicap ranking of tournamentsout arborescences

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20)

Cites Work

• A Contribution to the Theory of Chromatic Polynomials
• On Generalized Tournament Matrices
• Title not available (Why is that?)

Cited In (2)

• Random walks and diffusion on networks
• Generalized bicycles

This page was built for publication: A Graph Theoretical Approach to Handicap Ranking of Tournaments and Paired Comparisons

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3964593)