On the validity of a front-oriented approach to partitioning large sparse graphs with a connectivity constraint

DOI10.1007/BF02141748zbMath0861.90119OpenAlexW2064880188MaRDI QIDQ1921328

F. Lamour, Patrick~jun. Ciarlet

Publication date: 28 October 1996

Published in: Numerical Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02141748

zbMATH Keywords

heuristic\(p\)-edge partitioning problemconnectivity constraintlarge sparse graphs

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph theory (including graph drawing) in computer science (68R10) Distance in graphs (05C12) Connectivity (05C40)

Related Items

An exact algorithm for min-max hyperstructure equipartition with a connected constraint ⋮ A retrofit based methodology for the fast generation and optimization of large-scale mesh partitions: Beyond the minimum interface size criterion ⋮ Mechanism free domain decomposition ⋮ An efficient approach for large scale graph partitioning ⋮ Hemelb: A high performance parallel lattice-Boltzmann code for large scale fluid flow in complex geometries

Cites Work

• Unnamed Item
• Unnamed Item
• Graph theory applications
• A projection technique for partitioning the nodes of a graph
• Partitioning Sparse Matrices with Eigenvectors of Graphs
• Problème de la bipartition minimale d'un graphe
• A New Heuristic for Partitioning the Nodes of a Graph
• The Optimal Partitioning of Graphs
• An Efficient Heuristic Procedure for Partitioning Graphs
• An Automatic Nested Dissection Algorithm for Irregular Finite Element Problems
• A graph partitioning algorithm by node separators
• An Algorithm for Partitioning the Nodes of a Graph
• An Improved Spectral Graph Partitioning Algorithm for Mapping Parallel Computations