The following pages link to (Q3338296):
Displaying 12 items.
- On Laplacian spectra of parametric families of closely connected networks with application to cooperative control (Q506453) (← links)
- A new Lagrangian net algorithm for solving max-bisection problems (Q544198) (← links)
- Spectral partitioning works: planar graphs and finite element meshes (Q869898) (← links)
- Combinatorial and spectral aspects of nearest neighbor graphs in doubling dimensional and nearly-Euclidean spaces (Q1007250) (← links)
- Optimal partitions having disjoint convex and conic hulls (Q1190601) (← links)
- A quadratically convergent local algorithm on minimizing sums of the largest eigenvalues of a symmetric matrix (Q1312086) (← links)
- Spectral methods for graph bisection problems. (Q1406654) (← links)
- Algorithms for graph partitioning problems by means of eigenspace relaxations (Q1577115) (← links)
- New results on the completion time variance minimization (Q1805454) (← links)
- A projection technique for partitioning the nodes of a graph (Q1904714) (← links)
- Constrained partitioning problems (Q5896609) (← links)
- Algorithms for minclique scheduling problems (Q5961609) (← links)
