AI Chat AI Image Generator AI Video Text to Speech

Hypergraph partitions

09/18/2019

∙

by Alexander Mishchenko, et al.

∙

∙

We suggest a reduction of the combinatorial problem of hypergraph partitioning to a continuous optimization problem.

Alexander Mishchenko
1 publication
Vladimir Manuilov
1 publication
Chao You
1 publication
Han Yang
22 publications

page 1

page 2

page 3

page 4

research

∙ 12/25/2020

BiPart: A Parallel and Deterministic Multilevel Hypergraph Partitioner

Hypergraph partitioning is used in many problem domains including VLSI d...

0 Sepideh Maleki, et al. ∙

research

∙ 09/05/2017

Inhomogeneous Hypergraph Clustering with Applications

Hypergraph partitioning is an important problem in machine learning, com...

0 Pan Li, et al. ∙

research

∙ 03/25/2018

Evolutionary n-level Hypergraph Partitioning with Adaptive Coarsening

Hypergraph partitioning is an NP-hard problem that occurs in many comput...

0 Richard J. Preen, et al. ∙

research

∙ 07/13/2021

The Dynamic Complexity of Acyclic Hypergraph Homomorphisms

Finding a homomorphism from some hypergraph 𝒬 (or some relational struct...

0 Nils Vortmeier, et al. ∙

research

∙ 06/15/2021

Hypergraph Dissimilarity Measures

In this paper, we propose two novel approaches for hypergraph comparison...

11 Amit Surana, et al. ∙

research

∙ 06/29/2021

Distributed Matrix Tiling Using A Hypergraph Labeling Formulation

Partitioning large matrices is an important problem in distributed linea...

0 Avah Banerjee, et al. ∙

research

∙ 05/06/2019

Incorporating Weisfeiler-Leman into algorithms for group isomorphism

In this paper we combine many of the standard and more recent algebraic ...

0 Peter A. Brooksbank, et al. ∙