Eigenvalue approach to dense clusters in hypergraphs
From MaRDI portal
Density (toughness, etc.) (05C42) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Hypergraphs (05C65) Graph algorithms (graph-theoretic aspects) (05C85) Programming involving graphs or networks (90C35)
Cites work
- A network flow solution to some nonlinear 0-1 programming problems, with applications to graph theory
- Approximation algorithms for combinatorial optimization. 3rd international workshop, APPROX 2000, Saarbrücken, Germany, September 5--8, 2000. Proceedings
- Beyond the flow decomposition barrier
- Complex networks \& their applications X. Proceedings of the 10th international conference, COMPLEX NETWORKS 2021, Madrid, Spain, November 30 -- December 2, 2021. Volume 2
- Convergence to lexicographically optimal base in a (contra)polymatroid and applications to densest subgraph and tree packing
- Coverings of Bipartite Graphs
- Generalizing the hypergraph Laplacian via a diffusion process with mediators
- Graphen und Matrices.
- scientific article; zbMATH DE number 3138903 (Why is no real title available?)
- scientific article; zbMATH DE number 475375 (Why is no real title available?)
- scientific article; zbMATH DE number 964896 (Why is no real title available?)
- Hypergraph Markov Operators, Eigenvalues and Approximation Algorithms
- Laplacian eigenvalues and partition problems in hypergraphs
- Linear programming. Foundations and extensions
- On the Laplacian Eigenvalues and Metric Parameters of Hypergraphs
- Random walks and Laplacians on hypergraphs: when do they match?
- Spectral properties of hypergraph Laplacian and approximation algorithms
- Time bounds for selection
This page was built for publication: Eigenvalue approach to dense clusters in hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6978643)
