PaToH

PaToH (Partitioning Tools for Hypergraph) is a Multilevel Hypergraph Partitioning tool that I developed during my doctoral studies at Bilkent University (1994-1999). It was the fastest hypergraph partitioner when I wrote it, and probably it is still the fastest sequential partitioner today. Important features of PaToH: Fast, stable multilevel hypergraph partitioner, Hypergraph partitioning with fixed cells, Multi-constraint hypergraph partitioner

Keywords for this software

Anything in here will be replaced on browsers that support the canvas element

References in zbMATH (referenced in 38 articles )

Showing results 1 to 20 of 38.
Sorted by year (citations)

1 2 next

  1. Gnanasekaran, Abeynaya; Darve, Eric: Hierarchical orthogonal factorization: sparse square matrices (2022)
  2. Bohra, Navdeep; Bhatnagar, Vishal: Group level social media popularity prediction by MRGB and Adam optimization (2021)
  3. Dumitrasc, Andrei; Leleux, Philippe; Popa, Constantin; Ruede, Ulrich; Ruiz, Daniel: Extensions of the augmented block Cimmino method to the solution of full rank rectangular systems (2021)
  4. Selvitopi, Oguz; Acer, Seher; Manguoğlu, Murat; Aykanat, Cevdet: The effect of various sparsity structures on parallelism and algorithms to reveal those structures (2020)
  5. Acer, Seher; Kayaaslan, Enver; Aykanat, Cevdet: A hypergraph partitioning model for profile minimization (2019)
  6. Herrmann, Julien; Özkaya, M. Yusuf; Uçar, Bora; Kaya, Kamer; Çatalyürek, ÜMit V.: Multilevel algorithms for acyclic partitioning of directed acyclic graphs (2019)
  7. Shaydulin, Ruslan; Chen, Jie; Safro, Ilya: Relaxation-based coarsening for multilevel hypergraph partitioning (2019)
  8. Kayaaslan, Enver; Aykanat, Cevdet; Uçar, Bora: 1.5D parallel sparse matrix-vector multiply (2018)
  9. Kaya, Oguz; Uçar, Bora: Parallel Candecomp/Parafac decomposition of sparse tensors using dimension trees (2018)
  10. Torun, F. Sukru; Manguoglu, Murat; Aykanat, Cevdet: A novel partitioning method for accelerating the block Cimmino algorithm (2018)
  11. Rietmann, Max; Grote, Marcus; Peter, Daniel; Schenk, Olaf: Newmark local time stepping on high-performance computing architectures (2017)
  12. Drummond, L. A.; Duff, Iain S.; Guivarch, Ronan; Ruiz, Daniel; Zenadi, Mohamed: Partitioning strategies for the block Cimmino algorithm (2015)
  13. Duff, Iain S.; Guivarch, Ronan; Ruiz, Daniel; Zenadi, Mohamed: The augmented block Cimmino distributed method (2015)
  14. Sebastian Schlag, Vitali Henne, Tobias Heuer, Henning Meyerhenke, Peter Sanders, Christian Schulz: k-way Hypergraph Partitioning via n-Level Recursive Bisection (2015) arXiv
  15. Fagginger Auer, B. O.; Bisseling, R. H.: Efficient matching for column intersection graphs (2014)
  16. Yazici, Volkan; Aykanat, Cevdet: Constrained MIN-cut replication for (K)-way hypergraph partitioning (2014)
  17. Acer, Seher; Kayaaslan, Enver; Aykanat, Cevdet: A recursive bipartitioning algorithm for permuting sparse square matrices into block diagonal form with overlap (2013)
  18. Akbudak, Kadir; Kayaaslan, Enver; Aykanat, Cevdet: Hypergraph partitioning based models and methods for exploiting cache locality in sparse matrix-vector multiplication (2013)
  19. Çatalyürek, Ümit V.; Deveci, Mehmet; Kaya, Kamer; Uçar, Bora: UMPa: A multi-objective, multi-level partitioner for communication minimization (2013)
  20. Çatalyürek, Ümit V.; Kaya, Kamer; Langguth, Johannes; Uçar, Bora: A partitioning-based divisive clustering technique for maximizing the modularity (2013)

1 2 next