scholarly journals Approximation algorithms for the Weighted t-Uniform Sparsest Cut and some other graph partitioning problems

2016 ◽  
Vol 82 (6) ◽  
pp. 1044-1063
Author(s):  
Mohammad Khairul Hasan ◽  
Kyung-Yong Chwa
Keyword(s):  
Approximation Algorithms ◽  
Graph Partitioning ◽  
Partitioning Problems ◽  
Sparsest Cut

scholarly journals Stacked Community Prediction: A Distributed Stacking-Based Community Extraction Methodology for Large Scale Social Networks

2021 ◽  
Vol 5 (1) ◽  
pp. 14
Author(s):  
Christos Makris ◽  
Georgios Pispirigos
Keyword(s):  
Social Networks ◽  
Graph Partitioning ◽  
Large Scale ◽  
Real Life ◽  
Information Networks ◽  
Digital Marketing ◽  
Partitioning Problems ◽  
Iterative Solutions ◽  
Community Extraction ◽  
Stability And Accuracy

Nowadays, due to the extensive use of information networks in a broad range of fields, e.g., bio-informatics, sociology, digital marketing, computer science, etc., graph theory applications have attracted significant scientific interest. Due to its apparent abstraction, community detection has become one of the most thoroughly studied graph partitioning problems. However, the existing algorithms principally propose iterative solutions of high polynomial order that repetitively require exhaustive analysis. These methods can undoubtedly be considered resource-wise overdemanding, unscalable, and inapplicable in big data graphs, such as today’s social networks. In this article, a novel, near-linear, and highly scalable community prediction methodology is introduced. Specifically, using a distributed, stacking-based model, which is built on plain network topology characteristics of bootstrap sampled subgraphs, the underlined community hierarchy of any given social network is efficiently extracted in spite of its size and density. The effectiveness of the proposed methodology has diligently been examined on numerous real-life social networks and proven superior to various similar approaches in terms of performance, stability, and accuracy.

scholarly journals Path optimization for graph partitioning problems

1999 ◽  
Vol 90 (1-3) ◽  
pp. 27-50 ◽  
Author(s):  
Jonathan W Berry ◽  
Mark K Goldberg
Keyword(s):  
Graph Partitioning ◽  
Path Optimization ◽  
Partitioning Problems

scholarly journals Constant Factor Lasserre Integrality Gaps for Graph Partitioning Problems

2014 ◽  
Vol 24 (4) ◽  
pp. 1698-1717
Author(s):  
Venkatesan Guruswami ◽  
Ali Kemal Sinop ◽  
Yuan Zhou
Keyword(s):  
Graph Partitioning ◽  
Constant Factor ◽  
Integrality Gaps ◽  
Partitioning Problems
Sign in / Sign up

Export Citation Format

Share Document