Axiomatic characterization of transit functions of weak hierarchies
From MaRDI portal
Publication:5198027
DOI10.26493/2590-9770.1260.989zbMath1421.05029OpenAlexW2885993886WikidataQ129383081 ScholiaQ129383081MaRDI QIDQ5198027
G. Narasimha-Shenoi Prasanth, Manoj Changat, Peter F. Stadler
Publication date: 2 October 2019
Published in: The Art of Discrete and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.26493/2590-9770.1260.989
Related Items (2)
Cut vertex transit functions of hypergraphs ⋮ An interval convexity-based framework for multilevel clustering with applications to single-linkage clustering
Cites Work
- Systems of sets such that each set properly intersects at most one other set -- application to cluster analysis
- Binary clustering
- The induced path function, monotonicity and betweenness
- Axiomatic characterization of the interval function of a graph
- Triangle path transit functions, betweenness and pseudo-modular graphs
- Weak hierarchies associated with similarity measures - An additive clustering technique
- An order theoretic framework for overlapping clustering
- The induced path convexity, betweenness, and svelte graphs
- Convexities related to path properties on graphs
- Multilevel clustering models and interval convexities
- The \(k\)-weak hierarchical representations: An extension of the indexed closed weak hierarchies
- Induced path transit function, monotone and Peano axioms
- Les isomorphismes HTS et HTE. (The HTS and HTE isomorphisms)
- Axiomatic characterization of the interval function of a block graph
- The All-Paths Transit Function of a Graph
- n-ary transit functions in graphs
- Axiomatic characterization of transit functions of hierarchies
- Weak Hierarchies: A Central Clustering Structure
- On Lower-Maximal Paired-Ultrametrics
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Axiomatic characterization of transit functions of weak hierarchies
