Ranking the Vertices of a Paired Comparison Digraph

DOI10.1137/0606009MaRDI QIDQ3689208zbMATH OpenOpenAlexFDO

Authors A. Sakamoto, Mikio Kano

Publication date 1985

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

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

zbMATH Keywords

optimal rankingspaired comparison digraphscoringtournamentweight function

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Extremal problems in graph theory (05C35) Analysis of algorithms and problem complexity (68Q25) Management decision making, including multiple objectives (90B50)

Recommendations

• Ranking the vertices of an r-partite paired comparison digraph
• Ranking the vertices of a complete multipartite paired comparison digraph
• Ranking the vertices of complete multipartite paired-comparison digraphs
• On vertex rankings of graphs and its relatives
• Rankings of Directed Graphs
• scientific article; zbMATH DE number 1414315
• On ranking and unranking labeled digraphs
• Ranking numbers of graphs
• On graphs associated to sets of rankings

Cites work

• Graph theory with applications
• scientific article; zbMATH DE number 3400923 (Why is no real title available?)
• On Generalized Tournament Matrices
• Ranking the Participants in a Tournament
• Ranking the vertices of a weighted digraph using the length of forward arcs

Cited in

(15)

• Ranking by outdegree for directed graphs
• Beyond rankings: comparing directed acyclic graphs
• Characterizations of the 3-cycle count and backward length of a tournament
• Ranking the vertices of an r-partite paired comparison digraph
• Ranking the vertices of a complete multipartite paired comparison digraph
• Scoring of web pages and tournaments-axiomatizations
• A survey on the linear ordering problem for weighted or unweighted tournaments
• scientific article; zbMATH DE number 140117 (Why is no real title available?)
• Determining optimally ordered pairs using edge-coloring of graphs
• Ranking the vertices of a weighted digraph using the length of forward arcs
• On different ranking methods
• Sum of lengths of inversions in permutations
• Faster HodgeRank approximation algorithm for statistical ranking and user recommendation problems
• Ranking the vertices of complete multipartite paired-comparison digraphs
• An updated survey on the linear ordering problem for weighted or unweighted tournaments

This page was built for publication: Ranking the Vertices of a Paired Comparison Digraph

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