Boundary Vertices Sensitive Vertex-cut Partitioning Algorithm

Journal Title: Journal of Independent Studies and Research - Computing - Year 2015, Vol 13, Issue 2

Abstract

Graph Partitioning is one of the favorite research topics among researchers since the 70s. It attracts a diverse group of researchers from various fields such as engineering, science and mathematics. In the last decade, the graphs have increased in size to billions of vertices. Despite the fact that storage devices have become cheaper, processing these huge spanning graphs is not possible for a single machine. This call for the need of partitioning the graph so a group of machines can perform various parallel calculations on them which would save time and produce quick results. The research problem is that the ratio of boundary vertices to interior vertices increases with the increase in number of parti- tions for existing partitioning techniques available. To address this issue, the random edge selection method of Graph Lab algorithm was replaced with four suggested edge sorting techniques. The results were compared with the random edge selection method of Graph Lab using various performance parameters.

Authors and Affiliations

Keywords

Related Articles

Performance Analysis of Table Driven and Event Driven Protocols for Voice and Video Services in MANET

This research paper encompasses the performance analysis of table driven and event driven routing protocols by using voice and video traffic in mobile Adhoc network (MANET). Particularly, OLSR (table driven) and DSR (Eve...

Detection of Road for Landing of Aircraft in an Unfamiliar Environment: A Comparative Study

This paper is a comparative study about detecting straight road from satellite images. There are multiple applications of road detection. Here, only straight road is considered for use as a landing strip for aircraft eme...

Detection of Duplicate and Near-Duplicate Content for Web Crawlers

There is an abundance of duplicated web documents on the internet. For example, two documents online could be very similar to each other except for a very small portion, such as URLs and advertisements. While such differ...

Prospects of 5G Communications

The next generation of wireless communication is going to meet human demands beyond today’s trend. This study sets the frame on the future of wireless communication that requires real-time responses which pushes this tec...

An Object Detection using Image Processing in Digital Forensics Science

Object detection is one of the most important sectors in digital forensics science. The object detection technique is valuable for a number of purposes for instance: medical diagnosis scanners, traffic monitoring system,...

Download PDF file
  • EP ID EP643685
  • DOI 10.31645/jisrc/(2015).13.2.0001
  • Views 136
  • Downloads 0

How To Cite

(2015). Boundary Vertices Sensitive Vertex-cut Partitioning Algorithm. Journal of Independent Studies and Research - Computing, 13(2), 1-7. https://europub.co.uk/articles/-A-643685