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

DOI10.1007/BF02141748zbMATH Open0861.90119OpenAlexW2064880188MaRDI QIDQ1921328FDOQ1921328

Authors: 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

Recommendations

• An efficient approach for large scale graph partitioning
• scientific article; zbMATH DE number 2131658
• Multilevel algorithm for graph partitioning
• scientific article; zbMATH DE number 177834
• Algorithms for the Balanced Edge Partitioning Problem

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)

Cites Work

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

Cited In (6)

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

This page was built for publication: On the validity of a front-oriented approach to partitioning large sparse graphs with a connectivity constraint

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