scientific article
From MaRDI portal
Publication:3338296
zbMath0547.05059MaRDI QIDQ3338296
Alan J. Hoffman, Earl R. Barnes
Publication date: 1984
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
graph partitioninggraph spectruminteger programming problemgeneralized transportation problemsgreedy type algorithms
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Operations research and management science (90B99) Graph theory (05C99)
Related Items
A projection technique for partitioning the nodes of a graph, Spectral partitioning works: planar graphs and finite element meshes, Spectral methods for graph bisection problems., Constrained partitioning problems, Optimal partitions having disjoint convex and conic hulls, On Laplacian spectra of parametric families of closely connected networks with application to cooperative control, A new Lagrangian net algorithm for solving max-bisection problems, Algorithms for minclique scheduling problems, Combinatorial and spectral aspects of nearest neighbor graphs in doubling dimensional and nearly-Euclidean spaces, New results on the completion time variance minimization, Algorithms for graph partitioning problems by means of eigenspace relaxations, A quadratically convergent local algorithm on minimizing sums of the largest eigenvalues of a symmetric matrix
