scientific article; zbMATH DE number 1022238
From MaRDI portal
Publication:4339963
zbMATH Open0870.90095MaRDI QIDQ4339963FDOQ4339963
Frédéric Woirgard, Olivier Hudry, Irène Charon
Publication date: 16 June 1997
Full work available at URL: http://www.numdam.org/item?id=MSH_1996__133__23_0
Title of this publication is not available (Why is that?)
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)
Cited In (13)
- The plurality of social relations: \(k\)-partite representations of interdependent social forms
- A branch-and-bound algorithm to solve the linear ordering problem for weighted tournaments
- On the complexity of Slater's problems
- Medians in LLD meet semilattices and the case of orders
- The median procedure in the semilattice of orders
- Median orders of tournaments: A tool for the second neighborhood problem and Sumner's conjecture
- An updated survey on the linear ordering problem for weighted or unweighted tournaments
- Slater orders and Hamiltonian paths of tournaments
- Maximum distance between Slater orders and Copeland orders of tournaments
- A survey on the linear ordering problem for weighted or unweighted tournaments
- A 16-vertex tournament for which Banks set and Slater set are disjoint
- Title not available (Why is that?)
- Bounds on the disparity and separation of tournament solutions
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)