| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 1709551 | Applied Mathematics Letters | 2009 | 6 Pages |
Abstract
We use the generalization of the Laplacian matrix to hypergraphs to obtain several spectral-like results on partition problems in hypergraphs which are computationally difficult to solve (NP-hard or NP-complete). Therefore it is very important to obtain nontrivial bounds. More precisely, the following parameters are bounded in the paper: bipartition width, averaged minimal cut, isoperimetric number, max-cut, independence number and domination number.
Related Topics
Physical Sciences and Engineering
Engineering
Computational Mechanics
Authors
J.A. Rodríguez,