Hypergraph Partitioning - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Book Sections Year : 2011

Hypergraph Partitioning

Bora Uçar
Cevdet Aykanat
  • Function : Author
  • PersonId : 882785

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.
Fichier principal
Vignette du fichier
hp-encyc.pdf (747.27 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00786552 , version 1 (09-11-2019)

Identifiers

  • HAL Id : hal-00786552 , version 1

Cite

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

Share

Gmail Facebook X LinkedIn More