Open AccessThis article is
- freely available
Vertex Separators for Partitioning a Graph
Department of Software Engineering, Faculty of Computer Sciences, Izmir University of Economics, 35330 Balcova, Izmir, Turkey
Received: 5 December 2007; Accepted: 29 January 2008 / Published: 4 February 2008
Abstract: Finite Element Method (FEM) is a well known technique extensively studiedfor spatial and temporal modeling of environmental processes, weather predictioncomputations, and intelligent signal processing for wireless sensors. The need for hugecomputational power arising in such applications to simulate physical phenomenoncorrectly mandates the use of massively parallel computers to distribute the workloadevenly. In this study, a novel heuristic algorithm called Line Graph Bisection whichpartitions a graph via vertex separators so as to balance the workload amongst theprocessors and to minimize the communication overhead is proposed. The proposedalgorithm is proved to be computationally feasible and makes cost-effective parallelimplementations possible to speed up the solution process.
Keywords: Graph partitioning; Vertex separator; Heuristic algorithm
Article StatisticsClick here to load and display the download statistics.
Notes: Multiple requests from the same IP address are counted as one view.
Cite This Article
MDPI and ACS Style
Evrendilek, C. Vertex Separators for Partitioning a Graph. Sensors 2008, 8, 635-657.
Evrendilek C. Vertex Separators for Partitioning a Graph. Sensors. 2008; 8(2):635-657.
Evrendilek, Cem. 2008. "Vertex Separators for Partitioning a Graph." Sensors 8, no. 2: 635-657.