ABC(T)-graphs: an axiomatic characterization of the median procedure in graphs with connected and \(G^2\)-connected medians
From MaRDI portal
Publication:6633522
DOI10.1016/j.dam.2024.07.023MaRDI QIDQ6633522
Laurine Bénéteau, Victor Chepoi, Jérémie Chalopin, Yann Vaxès
Publication date: 6 November 2024
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Programming involving graphs or networks (90C35) Inventory, storage, reservoirs (90B05) Planar graphs; geometric and topological aspects of graph theory (05C10) Distance in graphs (05C12)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An ABC-problem for location and consensus functions on graphs
- Basis graphs of even delta-matroids
- Networks with Condorcet solutions
- A polynomial algorithm for b-matchings: An alternative approach
- A Helly theorem in weakly modular space
- The median procedure in cluster analysis and social choice theory
- The median procedure on median graphs
- Absolute retracts of bipartite graphs
- Minimax relations for the partial q-colorings of a graph
- Sur la notion de la moyenne.
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- A tight axiomatization of the median procedure on median graphs
- A self-stabilizing algorithm for the median problem in partial rectangular grids and their relatives
- Matroid basis graphs. I
- An Axiomatic Characterization of a Class of Locations in Tree Networks
- Graphs with Connected Medians
- An Axiomatic Approach to Location on Networks
- Weakly Modular Graphs and Nonpositive Curvature
- A Consistent Extension of Condorcet’s Election Principle
- A new characterization of tree medians with applications to distributed sorting
- Integer Programming: Methods, Uses, Computations
- Graphs with \(G^p\)-connected medians
This page was built for publication: ABC(T)-graphs: an axiomatic characterization of the median procedure in graphs with connected and \(G^2\)-connected medians
