Consensus methods for pyramids and other hypergraphs

MaRDI QIDQ4385384zbMATH OpenFDO

Authors Jeno Lehel, Robert C. Powers, F. R. McMorris

Publication date 13 April 1998

zbMATH Keywords

consensus functionshypergraphspyramidstotally balanced hypergraphs

Mathematics Subject Classification ID

Hypergraphs (05C65)

Review text

This paper primarily deals with consensus functions on tree hypergraphs such as pyramids and totally balanced hypergraphs. The paper gives an overview of several types of hypergraphs that have proved (or should prove) useful in classification studies. The possibilities for consensus functions on some tree-like hypergraphs have also been investigated. For the entire collection see [Zbl 0884.00046].

Recommendations

• Intersection rules for consensus hierarchies and pyramids
• Consensus of Star Tree Hypergraphs
• Consensus problems in weighted hierarchical graphs
• Consensus Dynamics and Opinion Formation on Hypergraphs
• Consensus algorithms for the generation of all maximal bicliques
• Consensus Seeking Over Random Weighted Directed Graphs
• A generalization of the graph Laplacian with application to a distributed consensus algorithm
• An Algorithmic Version of the Hypergraph Regularity Method
• scientific article; zbMATH DE number 3930803
• Distributed algorithms for matching in hypergraphs

Cited in

(4)

• From hypertrees to arboreal quasi-ultrametrics
• Binary set systems and totally balanced hypergraphs
• An axiomatic study of majority-rule \((+)\) and associated consensus functions on hierarchies
• Consensus of Star Tree Hypergraphs

This page was built for publication: Consensus methods for pyramids and other hypergraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4385384)