scientific article; zbMATH DE number 3378948

MaRDI QIDQ5650707zbMATH OpenFDO

Authors Jean-Claude Bermond

Publication date 1972

Full work available at URL http://www.numdam.org/item?id=MSH_1972__37__5_0, https://eudml.org/doc/94104

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Total orders (06A05)

Cited in

(15)

• Choosing from a tournament
• Aggregation of preferences: a review
• The median procedure in cluster analysis and social choice theory
• The Copeland measure of Condorcet choice functions
• New results on the computation of median orders
• Condorcet choice correspondences: A set-theoretical comparison
• A 16-vertex tournament for which Banks set and Slater set are disjoint
• Some Ramsey nu mbers for directed graphs
• The reversing number of a digraph
• On testing transitivity in online preference learning
• A branch-and-bound algorithm to solve the linear ordering problem for weighted tournaments
• A survey on the linear ordering problem for weighted or unweighted tournaments
• Intersections of random hypergraphs and tournaments
• Maximum distance between Slater orders and Copeland orders of tournaments
• An updated survey on the linear ordering problem for weighted or unweighted tournaments

This page was built for publication:

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