The median procedure on median graphs

DOI10.1016/S0166-218X(98)00003-1zbMath0906.05023OpenAlexW2004433054MaRDI QIDQ1392574

Fred S. Roberts, Henry Martyn Mulder, Fred R. McMorris

Publication date: 14 February 1999

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

Full work available at URL: http://www.elsevier.com/locate/dam

zbMATH Keywords

profiledistancemedian

Mathematics Subject Classification ID

Distance in graphs (05C12)

Related Items

Medians in median graphs and their cube complexes in linear time, Quasi-median graphs from sets of partitions, The median function on distributive semilattices, Medians and majorities in semimodular posets, Axiomatic characterization of the median function of a block graph, An ABC-problem for location and consensus functions on graphs, A theorem on Wiener-type invariants for isometric subgraphs of hypercubes, Computing median and antimedian sets in median graphs, The \(t\)-median function on graphs, On cube-free median graphs, The median function on Boolean lattices, Axiomatization and the antimean function on paths, The majority strategy on graphs, Steiner intervals in graphs, Median sets and median number of a graph, The median function of a block graph: axiomatic characterizations, Subquadratic-time algorithm for the diameter and all eccentricities on median graphs, The median function on median graphs and semilattices, Axioms for consensus functions on the \(n\)-cube, AXIOMATIC CHARACTERIZATION OF THE ANTIMEDIAN FUNCTION ON PATHS AND HYPERCUBES, The ℓ_p‐function on trees, The center function on trees, Axiomatic characterization of the center function. The case of non-universal axioms, On the remoteness function in median graphs, An axiomatization of the median procedure on the \(n\)-cube, Majority rule for profiles of arbitrary length, with an emphasis on the consistency axiom, Computer science and decision theory, Kazhdan and Haagerup properties from the median viewpoint., AXIOMATIC CHARACTERIZATION OF THE MEAN FUNCTION ON TREES, Crossing graphs of fiber-complemented graphs, The median function on graphs with bounded profiles, The ℓp-function on finite Boolean lattices, Crossing graphs of fiber-complemented graphs, Recognizing median graphs in subquadratic time, Netlike partial cubes, V: completion and netlike classes, Induced cycles in crossing graphs of median graphs, What Do Trees and Hypercubes Have in Common?, Five axioms for location functions on median graphs, THE MEDIAN FUNCTION ON TREES, Strategy-Proof Location Functions on Finite Graphs, Axiomatic characterization of the center function. the case of universal axioms, Axiomatic characterization of the median and antimedian function on a complete graph minus a matching

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Median graphs, parallelism and posets
• Lattice valuations, medians and majorities
• Medians in median graphs
• On the use of ordered sets in problems of comparison and consensus of classifications
• The median procedure in cluster analysis and social choice theory
• The structure of median graphs
• Median graphs and Helly hypergraphs
• An axiomatic characterization of some locations in trees
• The median procedure for n-trees
• Metric Ternary Distributive Semi-Lattices
• Discrete Ordered Sets whose Covering Graphs are Median
• A Formal Theory of Consensus
• Medians and Majorities in Semimodular Lattices
• n‐cubes and median graphs
• Theorie De La Mediane Dans Les Treillis Distributes Finis Et Applications
• Centroids and medians of finite metric spaces
• A Consistent Extension of Condorcet’s Election Principle
• The Median Procedure in a Formal Theory of Consensus
• A modification of the median of a tree