The following pages link to Fred R. McMorris (Q734370):
Displaying 50 items.
- (Q192857) (redirect page) (← links)
- An ABC-problem for location and consensus functions on graphs (Q290094) (← links)
- Some axiomatic limitations for consensus and supertree functions on hierarchies (Q307637) (← links)
- An axiomatic study of majority-rule \((+)\) and associated consensus functions on hierarchies (Q411843) (← links)
- Semigroups that tree order sets on which they act (Q594115) (← links)
- Majority-rule (+) consensus trees (Q608873) (← links)
- Axioms for consensus functions on the \(n\)-cube (Q670457) (← links)
- \(p\)-competition numbers (Q689960) (← links)
- A characterization of majority rule for hierarchies (Q734371) (← links)
- The target location function on finite trees (Q777399) (← links)
- The \(t\)-median function on graphs (Q858309) (← links)
- On an independence condition for consensus \(n\)-trees (Q922253) (← links)
- Consensus rules based on decisive families: the case of hierarchies (Q1042322) (← links)
- Some uniqueness results for upper bound graphs (Q1053714) (← links)
- Axioms for consensus functions on undirected phylogenetic trees (Q1060980) (← links)
- A formalization of consensus index methods (Q1062389) (← links)
- Axioms for consensus functions based on lower bounds in posets (Q1083346) (← links)
- The number of cladistic characters (Q1149895) (← links)
- Consensus n-trees (Q1150336) (← links)
- When is one estimate of evolutionary relationships a refinement of another? (Q1153839) (← links)
- Connectivity threshold for random chordal graphs (Q1175564) (← links)
- Consensus weak hierarchies (Q1176714) (← links)
- Independence conditions for consensus \(n\)-trees revisited (Q1180319) (← links)
- Consensus sequences based on plurality rule (Q1199388) (← links)
- Interpreting consensus sequences based on plurality rule (Q1205295) (← links)
- Retractions and S-endomorphisms (Q1215024) (← links)
- An idealized concept of the true cladistic character (Q1216376) (← links)
- A mathematical foundation for the analysis of cladistic character compatibility (Q1235195) (← links)
- When are two qualitative taxonomic characters compatible? (Q1237438) (← links)
- On the compatibility of binary qualitative taxonomic characters (Q1237657) (← links)
- An algebraic analysis of cladistic characters (Q1241462) (← links)
- Abian's order relation for semigroups (Q1249198) (← links)
- On probe interval graphs (Q1281778) (← links)
- Consensus rules for committee elections (Q1296465) (← links)
- The computation of consensus patterns in \(DNA\) sequences (Q1310190) (← links)
- Abstract sphere-of-influence graphs (Q1310234) (← links)
- Consensus functions on trees that satisfy an independence axiom (Q1314322) (← links)
- The agreement metric for labeled binary trees (Q1340485) (← links)
- On the consistency of the plurality rule consensus function for molecular sequences (Q1344860) (← links)
- The median procedure on median graphs (Q1392574) (← links)
- Strategy-proof consensus rules for committee elections. (Q1410900) (← links)
- Graphs with only caterpillars as spanning trees (Q1415546) (← links)
- Attainable results in committee elections. (Q1596956) (← links)
- Consensus functions on tree quasi-orders that satisfy an independence condition (Q1763887) (← links)
- Tolerance competition graphs (Q1805304) (← links)
- \(p\)-competition graphs (Q1805319) (← links)
- The median procedure for n-trees (Q1822174) (← links)
- M-chain graphs of posets (Q1823266) (← links)
- Consensus functions defined on trees (Q1839179) (← links)
- Tolerance orders and bipartite unit tolerance graphs (Q1841895) (← links)
