Skip to Main content Skip to Navigation
New interface
Book sections

Hypergraph Partitioning

Abstract : Hypergraphs are generalization of graphs where each edge (hyperedge) can connect more than two vertices. In simple terms, the hypergraph partitioning problem can be defined as the task of dividing the vertices of hypergraph into two or more roughly equal sized parts such that a cost function on the hyperedges connecting vertices in different parts is minimized.
Complete list of metadata

Cited literature [28 references]  Display  Hide  Download

https://hal.inria.fr/hal-00786552
Contributor : Equipe Roma Connect in order to contact the contributor
Submitted on : Saturday, November 9, 2019 - 4:14:40 PM
Last modification on : Thursday, September 29, 2022 - 2:58:07 PM
Long-term archiving on: : Monday, February 10, 2020 - 4:37:56 PM

File

hp-encyc.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00786552, version 1

Collections

Citation

Umit V. Catalyurek, Bora Uçar, Cevdet Aykanat. Hypergraph Partitioning. David A. Padua. Encyclopedia of Parallel Computing, Springer, pp.871--881, 2011. ⟨hal-00786552⟩

Share

Metrics

Record views

142

Files downloads

242