scientific article; zbMATH DE number 3871421

zbMATH Open0547.05059MaRDI QIDQ3338296FDOQ3338296

Authors: Alan J. Hoffman, Earl R. Barnes 

Publication date: 1984

Title of this publication is not available (Why is that?)

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

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)

Cited In (20)

• Enumeration of the partitions with minimum diameter
• Algorithms for minclique scheduling problems
• Efficient algorithm for optimizing spectral partitions
• A quadratically convergent local algorithm on minimizing sums of the largest eigenvalues of a symmetric matrix
• Spectral methods for graph bisection problems.
• A projection technique for partitioning the nodes of a graph
• Optimal partitions having disjoint convex and conic hulls
• Lower bounds to the graph partitioning problem through generalized linear programming and network flows
• New results on the completion time variance minimization
• 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
• Title not available (Why is that?)
• On some difficult linear programs coming from set partitioning
• On Laplacian spectra of parametric families of closely connected networks with application to cooperative control
• Constrained partitioning problems
• Algorithms for graph partitioning problems by means of eigenspace relaxations
• Linear-shaped partition problems
• Title not available (Why is that?)

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)