Publication:3338296
From MaRDI portal
zbMath0547.05059MaRDI QIDQ3338296
Alan J. Hoffman, Earl R. Barnes
Publication date: 1984
graph partitioning; graph spectrum; integer programming problem; generalized transportation problems; greedy type algorithms
05C50: Graphs and linear algebra (matrices, eigenvalues, etc.)
90B99: Operations research and management science
05C99: Graph theory
Related Items
Constrained partitioning problems, Algorithms for minclique scheduling problems, Spectral partitioning works: planar graphs and finite element meshes, Combinatorial and spectral aspects of nearest neighbor graphs in doubling dimensional and nearly-Euclidean spaces, Optimal partitions having disjoint convex and conic hulls, A quadratically convergent local algorithm on minimizing sums of the largest eigenvalues of a symmetric matrix, Spectral methods for graph bisection problems., Algorithms for graph partitioning problems by means of eigenspace relaxations, New results on the completion time variance minimization, A projection technique for partitioning the nodes of a graph