Everything about Balanced hypergraph

🧭 Start here: a 6-step reading path

1. Read the overview: Balanced hypergraphA 5-minute orientation
2. Pick up a classic book: Experimental AlgorithmsThe most-reprinted book on the subject
3. Read the landmark paper: HEPart: A balanced hypergraph partitioning algorithm for big data applicationsCited 27 times
4. Go sideways: Matching in hypergraphsA closely related topic
5. Go sideways: Bipartite hypergraphA closely related topic

🏆 Landmark papers (most cited)

• HEPart: A balanced hypergraph partitioning algorithm for big data applications

  Wenyin Yang, Guojun Wang, Kim-Kwang Raymond Choo · 2018 · Future Generation Computer Systems · 27 citations

• Edge Balanced 3-Uniform Hypergraph Designs

  Paola Bonacini, Mario Gionfriddo, Lucia Marino · 2020 · Mathematics · 5 citations

• Edge balanced star‐hypergraph designs and vertex colorings of path designs

  Paola Bonacini, Lucia Marino · 2022 · Journal of Combinatorial Designs · 4 citations

• Generation of Initial Partitions for Hypergraph Balanced Cut Problem

  M.V. Sheblaev · 2018 · Problems of advanced micro- and nanoelectronic systems development · 0 citations

• Spatio-Temporal Balanced Hypergraph Network for cross-city urban traffic flow prediction under data scarcity

  Yansong Wang, Xiangyu Song, Wei Li · 2027 · Advanced Engineering Informatics · 0 citations

📚 Books worth reading

• Experimental AlgorithmsVincenzo Bonifaci · 2013
• 📕Strongly balanced cooperative gamesMichel Le Breton · 1992
• Brain InformaticsFabio Massimo Zanzotto · 2012
• Applications of Evolutionary ComputationAnna Isabel Esparcia-Alcázar · 2013

Ranked by number of editions on Open Library, a rough measure of how lasting a book is.

🔗 Related topics

• Matching in hypergraphs In graph theory, a matching in a hypergraph is a set of hyperedges, in which every two hyperedges are disjoint. It is an extension of the notion of matching…
• Bipartite hypergraph In graph theory, the term bipartite hypergraph describes several related classes of hypergraphs, all of which are natural generalizations of a bipartite…
• Hall-type theorems for hypergraphs In the mathematical field of graph theory, Hall-type theorems for hypergraphs are several generalizations of Hall's marriage theorem from graphs to hypergraphs…
• Bipartite graph In the mathematical field of graph theory, a bipartite graph (or bigraph) is a graph whose vertices can be divided into two disjoint and independent sets…
• Fractional matching In graph theory, a fractional matching is a generalization of a matching in which, intuitively, each vertex may be broken into fractions that are matched…
• Hypergraph In mathematics, a hypergraph is a generalization of a graph in which an edge can join any number of vertices. In contrast, in an ordinary graph, an edge…
• Deficiency (graph theory) Deficiency is a concept in graph theory that is used to refine various theorems related to perfect matching in graphs, such as Hall's marriage theorem…
• Rainbow matching In the mathematical discipline of graph theory, a rainbow matching in an edge-colored graph is a matching in which all the edges have distinct colors.…