Publication:791544: Difference between revisions
From MaRDI portal
Publication:791544
Created automatically from import240129110113 Β |
(No difference)
|
Latest revision as of 11:05, 30 January 2024
DOI10.1016/0166-218X(84)90096-9zbMATH Open0536.05057DBLPjournals/dam/BandeltB84WikidataQ60962144 ScholiaQ60962144MaRDI QIDQ791544FDOQ791544
J. P. BarthΓ©lemy, Hans-JΓΌrgen Bandelt
Publication date: 1984
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
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?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The median procedure in cluster analysis and social choice theory
- Median algebras
- Metric Ternary Distributive Semi-Lattices
- Path length in the covering graph of a lattice
- Theorie De La Mediane Dans Les Treillis Distributes Finis Et Applications
- New perspectives in competitive location theory
- Centers to centroids in graphs
- Medians, Lattices, and Trees
- Medians of arbitrary graphs
- Median graphs and Helly hypergraphs
- Discrete Ordered Sets whose Covering Graphs are Median
- Caracterisation Mediane Des Arbres
Cited In (56)
- On condorcet and median points of simple rectilinear polygons
- Core potentials: the consensus segmentation conjecture
- Graphs with \(G^p\)-connected medians
- Stable outcomes in simple cooperative games
- Majority rule in the absence of a majority
- The median function on median graphs and semilattices
- Computing median and antimedian sets in median graphs
- Lattice valuations, medians and majorities
- Median sets and median number of a graph
- The median function on graphs with bounded profiles
- Strategy-proof aggregation rules and single peakedness in bounded distributive lattices
- Pseudo-modular graphs
- The majority strategy on graphs
- Median graphs and tree analysis of dichotomous data, an approach to qualitative factor analysis
- The \(t\)-median function on graphs
- Mean graphs
- On the remoteness function in median graphs
- Medians and majorities in semimodular posets
- A fixed cube theorem for median graphs
- Median problem in some plane triangulations and quadrangulations.
- Steiner intervals in graphs
- Graph theory (algorithmic, algebraic, and metric problems)
- What Do Trees and Hypercubes Have in Common?
- Distance-hereditary graphs
- Medians and centres of polyominoes
- The median procedure for n-trees
- Understanding the generalized median stable matchings
- On the use of ordered sets in problems of comparison and consensus of classifications
- Medians are below joins in semimodular lattices of breadth 2
- Proximity and average eccentricity of a graph
- The median procedure on median graphs
- Median graphs, parallelism and posets
- Computing a median point of a simple rectilinear polygon
- Local medians in chordal graphs
- Medians for weight metrics in the covering graphs of semilattices
- Arrowian characterizations of latticial federation consensus functions
- On the semilattice of weak orders of a set
- The median function on distributive semilattices
- A converse to the Sholander embedding
- Comparing medians
- Condorcet winners on median spaces
- Topes of oriented matroids and related structures
- Plural psychological developmental models: An ordinal generalization of the Guttman scale
- Planar median graphs and cubesquare-graphs
- Hereditary modular graphs
- Recognizing median graphs in subquadratic time
- Networks with Condorcet solutions
- Majority judgment and strategy-proofness: a characterization
- Absolute retracts of bipartite graphs
- Weakly unimodal domains, anti-exchange properties, and coalitional strategy-proofness of aggregation rules
- A multifacility location problem on median spaces
- A new characterization of median graphs
- On the consistency of the plurality rule consensus function for molecular sequences
- On cube-free median graphs
- Medians in median graphs and their cube complexes in linear time
- A self-stabilizing algorithm for the median problem in partial rectangular grids and their relatives
Recommendations
- 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 on median graphs π π
- On median graphs and median grid graphs π π
- Median sets and median number of a graph π π
- Mean graphs π π
- Graphs with connected medians π π
- Median of a graph with respect to edges π π
This page was built for publication: Medians in median graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q791544)