Consensus methods for dendrograms representing numerically stratified hierarchic nested classifications are discussed. An algorithm for computing the consensus n-trees which result from Neumann''s (1983) generalized intersection methods is given. This algorithm involves operations on the matrices of cophenetic values representing the original n-trees. An approach for extending known intersection consensus methods for n-trees (e.g., Adams, cardinality intersection, strict) to consensus methods for dendrograms is proposed.