Pages that link to "Item:Q794118"
From MaRDI portal
The following pages link to Faithful consensus methods for n-trees (Q794118):
Displaying 19 items.
- The role of complexity in comparing classifications (Q585631) (← links)
- DASACT: a decision aiding software for axiomatic consensus theory (Q899602) (← links)
- On an independence condition for consensus \(n\)-trees (Q922253) (← links)
- Consensus rules based on decisive families: the case of hierarchies (Q1042322) (← links)
- Efficient and binary consensus functions on transitively valued relations (Q1059534) (← links)
- Euclidean consensus dendrograms and other classification structures (Q1060515) (← links)
- Axioms for consensus functions on undirected phylogenetic trees (Q1060980) (← links)
- A formalization of consensus index methods (Q1062389) (← links)
- Optimal algorithms for comparing trees with labeled leaves (Q1074275) (← links)
- Consensus supertrees: The synthesis of rooted trees containing overlapping sets of labeled leaves (Q1091713) (← links)
- On the use of ordered sets in problems of comparison and consensus of classifications (Q1104668) (← links)
- N-trees as nestings: Complexity, similarity, and consensus (Q1104670) (← links)
- Preserving consensus hierarchies (Q1344864) (← links)
- s-consensus index method: An additional axiom (Q1822175) (← links)
- On lattice consensus methods (Q1822176) (← links)
- Intersection rules for consensus \(n\)-trees (Q1895115) (← links)
- Stability conditions for consensus functions defined on \(n\)-trees (Q1900286) (← links)
- Dictatorial consensus functions on \(n\)-trees (Q2366122) (← links)
- (Q5091736) (← links)
