Boundary Vertices Sensitive Vertex-Cut Partitioning Algorithm
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 tha...
Main Authors: | Asad Feroz Ali, Syed Saif ur Rahman |
---|---|
Format: | Article |
Language: | English |
Published: |
Shaheed Zulfikar Ali Bhutto Institute of Science and Technology
2015-12-01
|
Series: | JISR on Computing |
Subjects: | |
Online Access: | https://jisrc.szabist.edu.pk/ojs/index.php/jisrc/article/view/125 |
Similar Items
-
The partition dimension of the vertex amalgamation of some cycles
by: Hasmawati, et al.
Published: (2022-06-01) -
Clustering Vertex-Weighted Graphs by Spectral Methods
by: Juan-Luis García-Zapata, et al.
Published: (2021-11-01) -
A method to construct graphs with certain partition dimension
by: Debi Oktia Haryeni, et al.
Published: (2019-10-01) -
Graph partitionning /
by: Bichot, Charles-Edmond 532206, et al.
Published: (c201) -
Partitioning Harary graphs into connected subgraphs containing prescribed vertices
by: Olivier Baudon, et al.
Published: (2014-12-01)