Uniform hypergraph partitioning: provable tensor methods and sampling techniques
From MaRDI portal
Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Computing methodologies for image processing (68U10) Signed and weighted graphs (05C22) Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Recommendations
- Consistency of spectral hypergraph partitioning under planted partition model
- Hypergraph clustering using a new Laplacian tensor with applications in image processing
- The Fiedler vector of a Laplacian tensor for hypergraph partitioning
- k-way hypergraph partitioning via n-level recursive bisection
- Nonbacktracking Spectral Clustering of Nonuniform Hypergraphs
Cited in
(12)- scientific article; zbMATH DE number 7415089 (Why is no real title available?)
- The Fiedler vector of a Laplacian tensor for hypergraph partitioning
- Exact recovery in the hypergraph stochastic block model: a spectral algorithm
- Multilayer hypergraph clustering using the aggregate similarity matrix
- Hypergraph clustering using a new Laplacian tensor with applications in image processing
- Generalizing p-Laplacian: spectral hypergraph theory and a partitioning algorithm
- Partial recovery and weak consistency in the non-uniform hypergraph stochastic block model
- A family of pairwise multi-marginal optimal transports that define a generalized metric
- Modeling Hypergraphs with Diversity and Heterogeneous Popularity
- Sparse random hypergraphs: non-backtracking spectra and community detection
- Community Detection in General Hypergraph Via Graph Embedding
- Consistency of spectral hypergraph partitioning under planted partition model
This page was built for publication: Uniform hypergraph partitioning: provable tensor methods and sampling techniques
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5361317)
