An Algorithm for Partitioning the Nodes of a Graph

DOI10.1137/0603056MaRDI QIDQ4740598zbMATH OpenOpenAlexFDO

Authors Earl R. Barnes

Publication date 1982

Published in SIAM Journal on Algebraic Discrete Methods (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0603056

zbMATH Keywords

linear programming transportation problempartitioning into disjoint subsets

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Analysis of algorithms and problem complexity (68Q25)

Cites work

• An Efficient Heuristic Procedure for Partitioning Graphs
• scientific article; zbMATH DE number 3643026 (Why is no real title available?)
• scientific article; zbMATH DE number 3167494 (Why is no real title available?)
• scientific article; zbMATH DE number 3316542 (Why is no real title available?)
• Lower Bounds for the Partitioning of Graphs
• The variation of the spectrum of a normal matrix

Cited in

(26)

• Grouping of parts and components in flexible manufacturing systems
• Optimal partitions having disjoint convex and conic hulls
• An algorithm to maximize the agreement between partitions
• Modeling hypergraphs by graphs with the same mincut properties
• Spectral partitioning with multiple eigenvectors
• A quadratically convergent local algorithm on minimizing sums of the largest eigenvalues of a symmetric matrix
• A computational study of graph partitioning
• On the magnetisation of the ground states in two dimensional Ising spin glasses
• Spectral methods for graph bisection problems.
• Algorithms for graph partitioning problems by means of eigenspace relaxations
• A mini-line approach for pull production
• Two-stage algorithm using influence coefficient for detecting the hierarchical, non-overlapping and overlapping community structure
• Approximation techniques for hypergraph partitioning problems
• A projection technique for partitioning the nodes of a graph
• On the validity of a front-oriented approach to partitioning large sparse graphs with a connectivity constraint
• Global discriminative-based nonnegative spectral clustering
• Bayesian degree-corrected stochastic blockmodels for community detection
• Graph Coloring Using Eigenvalue Decomposition
• Finding part-machine families using graph partitioning techniques
• EVALUATION OF AUTOMATIC DOMAIN PARTITIONING ALGORITHMS FOR PARALLEL FINITE ELEMENT ANALYSIS
• A hierarchical approach for metal parts fabrication
• Un Algorithme pour la Bipartition d'un Graphe en Sous-graphes de Cardinalité Fixée
• Algorithms for minclique scheduling problems
• Incremental methods for community detection in both fully and growing dynamic networks
• Spectral partitioning works: planar graphs and finite element meshes
• Algorithms for searching paths in huge graphs

This page was built for publication: An Algorithm for Partitioning the Nodes of a Graph

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