Comparison of properties of graphs and hyper-graphs
| Graph | Hyper-graph | |
|---|---|---|
| Representation | A(|V | × |V |) | H(|V | × |E |) |
| Minimum cut | NP-Hard | NP-Complete |
| Spectral clustering | Real-valued | Real-valued |
| optimization | optimization | |
| Spectral embedding | Matrix | Project to |
| factorization | eigenspace |
| Graph | Hyper-graph | |
|---|---|---|
| Representation | A(| | H(| |
| Minimum cut | NP-Hard | NP-Complete |
| Spectral clustering | Real-valued | Real-valued |
| optimization | optimization | |
| Spectral embedding | Matrix | Project to |
| factorization | eigenspace |
Sharing content requires targeting cookies to be enabled. Please update your cookie preferences to use this feature.