Using Equivalence Relations For Hypergraph Partitioning
MetadataShow full item record
We have found that hypergraph partitioning is a problem particularly suited to parallel computation. We found that PMondriaan solves some issues effectively but lacks on many others, generally having mixed results. We also found that PMondriaan is not yet ready for the purpose it was created for, but we also see clear paths towards these goals. We also have introduced the notion of instance equivalence in a specific manner and its application to hypergraph partitioning with fixed vertices. We found that instance equivalence can be useful, but it is not yet clear how to best take advantage of the concepts. We also saw how to practically implement all of the theoretical algorithms used and have seen some results that follow from the implemented software. Last we also saw that there may be implications of the theory that apply to other similar projects, like what coarsening rating function is used.
Showing items related by title, author, creator and subject.
Lamboo, Casper (2021)3D printers are used for various applications such as education, manufacturing and prototyping. Prototyping is a process where it is very useful to have a physical representation of the object that is being designed. A ...
Jenneskens, Lieneke (2021)Matrix-vector multiplications appear in many algorithms, and in many cases the matrices used in these multiplications are sparse. The time needed for the matrix-vector multiplication computation can be decreased by performing ...
Pelt, D.M. (2011)An important component of many scientific computations is the matrix-vector multiplication. An efficient parallelization of the matrix-vector multiplication would instantly lower computation times in many areas of scientific ...