scientific article; zbMATH DE number 3871421

MaRDI QIDQ3338296zbMATH OpenFDO

Authors Alan J. Hoffman, Earl R. Barnes

Publication date 1984

zbMATH Keywords

graph partitioninggraph spectruminteger programming problemgeneralized transportation problemsgreedy type algorithms

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph theory (05C99) Operations research and management science (90B99)

Recommendations

• Algorithms for graph partitioning problems by means of eigenspace relaxations
• scientific article; zbMATH DE number 736319
• Constructive Heuristics and Lower Bounds for Graph Partitioning Based on a Principal-Components Approximation
• Graph partitioning using linear and semidefinite programming
• A computational study of graph partitioning

Cited in

(20)

• scientific article; zbMATH DE number 1416066 (Why is no real title available?)
• Enumeration of the partitions with minimum diameter
• A quadratically convergent local algorithm on minimizing sums of the largest eigenvalues of a symmetric matrix
• Efficient algorithm for optimizing spectral partitions
• Spectral methods for graph bisection problems.
• A projection technique for partitioning the nodes of a graph
• Algorithms for minclique scheduling problems
• Optimal partitions having disjoint convex and conic hulls
• New results on the completion time variance minimization
• Lower bounds to the graph partitioning problem through generalized linear programming and network flows
• Combinatorial and spectral aspects of nearest neighbor graphs in doubling dimensional and nearly-Euclidean spaces
• Constructive Heuristics and Lower Bounds for Graph Partitioning Based on a Principal-Components Approximation
• Spectral partitioning works: planar graphs and finite element meshes
• A new Lagrangian net algorithm for solving max-bisection problems
• scientific article; zbMATH DE number 736319 (Why is no real title available?)
• On some difficult linear programs coming from set partitioning
• On Laplacian spectra of parametric families of closely connected networks with application to cooperative control
• Algorithms for graph partitioning problems by means of eigenspace relaxations
• Linear-shaped partition problems
• Constrained partitioning problems

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3338296)