Pages that link to "Item:Q1577115"
From MaRDI portal
The following pages link to Algorithms for graph partitioning problems by means of eigenspace relaxations (Q1577115):
Displaying 11 items.
- A note on edge-based graph partitioning and its linear algebraic structure (Q662140) (← links)
- A faster algorithm for computing the principal sequence of partitions of a graph (Q848839) (← links)
- Spectra and optimal partitions of weighted graphs (Q1322166) (← links)
- A computational study of graph partitioning (Q1340061) (← links)
- A projection technique for partitioning the nodes of a graph (Q1904714) (← links)
- An exact algorithm for graph partitioning (Q1942271) (← links)
- Spectral bounds for graph partitioning with prescribed partition sizes (Q2328109) (← links)
- Constrained Graph Partitioning via Matrix Differential Equations (Q4615297) (← links)
- (Q5111755) (← links)
- Eigenvalue, quadratic programming, and semidefinite programming relaxations for a cut minimization problem (Q5963676) (← links)
- Minimal Dirichlet energy partitions for graphs (Q6486747) (← links)