ABC(T)-graphs: an axiomatic characterization of the median procedure in graphs with connected and G^2-connected medians

DOI10.1016/J.DAM.2024.07.023MaRDI QIDQ6633522FDOQ6633522

Laurine Bénéteau, Victor Chepoi, J. Chalopin, Yann Vaxès

Publication date: 6 November 2024

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

facility locationunimodalityconsensus functionmedian functiongraph distancesaxiomatic approach

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Distance in graphs (05C12) Inventory, storage, reservoirs (90B05)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• The median procedure in cluster analysis and social choice theory
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• A Consistent Extension of Condorcet’s Election Principle
• Integer Programming: Methods, Uses, Computations
• The median procedure on median graphs
• A tight axiomatization of the median procedure on median graphs
• An ABC-problem for location and consensus functions on graphs
• An Axiomatic Approach to Location on Networks
• A polynomial algorithm for b-matchings: An alternative approach
• Networks with Condorcet solutions
• A Helly theorem in weakly modular space
• An axiomatic characterization of a class of locations in tree networks
• Absolute retracts of bipartite graphs
• Matroid basis graphs. I
• Minimax relations for the partial q-colorings of a graph
• Graphs with connected medians
• Weakly Modular Graphs and Nonpositive Curvature
• Basis graphs of even delta-matroids
• A new characterization of tree medians with applications to distributed sorting
• Sur la notion de la moyenne.
• A self-stabilizing algorithm for the median problem in partial rectangular grids and their relatives
• 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

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