On the validity of a front-oriented approach to partitioning large sparse graphs with a connectivity constraint |
| |
Authors: | P. Ciarlet Jr. F. Lamour |
| |
Affiliation: | (1) Commissariat à l'Energie Atomique, LV, D.MA, MCN, F-94195 Villeneuve-St-Georges Cedex, France;(2) Department of Mathematics, University of California at Los Angeles, 90095, CA, USA |
| |
Abstract: | In this paper we consider the problem of partitioning large sparse graphs, such as finite element meshes. The heuristic which is proposed allows to partition into connected and quasi-balanced subgraphs in a reasonable amount of time, while attempting to minimize the number of edge cuts. Here the goal is to build partitions for graphs containing large numbers of nodes and edges, in practice at least 104. Basically, the algorithm relies on the iterative construction of connected subgraphs. This construction is achieved by successively exploring clusters of nodes called fronts. Indeed, a judicious use of fronts ensures the connectivity of the subsets at low cost: it is shown that locally, i.e. for a given subgraph, the complexity of such operations grows at most linearly with the number of edges. Moreover, a few examples are given to illustrate the quality and speed of the heuristic.The work of this author was partially supported by the DGA/DRET under contract 93-1192 and by the Army Research Office under contract DAAL03-91-C-0047 (Univ. Tenn. subcontract ORA4466.04 Amendment 1).The work of this author was partially supported by the National Science Foundation under contract ASC 92-01266, the Army Research Office under contract DAAL03-91C-0047 (Univ. Tenn. subcontract ORA4466.04 Amendment 1), and ONR under contract ONR-N00014-92-J-1890. |
| |
Keywords: | Algorithm connectivity graphs partitioning |
本文献已被 SpringerLink 等数据库收录! |
|