scientific article; zbMATH DE number 1022238

zbMATH Open0870.90095MaRDI QIDQ4339963FDOQ4339963

Authors Irène Charon, Olivier Hudry, Frédéric Woirgard

Publication date 16 June 1997

Full work available at URL http://www.numdam.org/item?id=MSH_1996__133__23_0

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Directed graphs (digraphs), tournaments (05C20) Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• Slater orders and Hamiltonian paths of tournaments
• scientific article; zbMATH DE number 878679
• On the complexity of Slater's problems
• scientific article; zbMATH DE number 1022239
• Publication:4946665

Cited in

(13)

• A 16-vertex tournament for which Banks set and Slater set are disjoint
• Median orders of tournaments: A tool for the second neighborhood problem and Sumner's conjecture
• On the complexity of Slater's problems
• scientific article; zbMATH DE number 1422720 (Why is no real title available?)
• Bounds on the disparity and separation of tournament solutions
• An updated survey on the linear ordering problem for weighted or unweighted tournaments
• Slater orders and Hamiltonian paths of tournaments
• The median procedure in the semilattice of orders
• A branch-and-bound algorithm to solve the linear ordering problem for weighted tournaments
• The plurality of social relations: \(k\)-partite representations of interdependent social forms
• A survey on the linear ordering problem for weighted or unweighted tournaments
• Maximum distance between Slater orders and Copeland orders of tournaments
• Medians in LLD meet semilattices and the case of orders

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 Q4339963)