Synapse
⌘+K
Synapse
PulseExploreClubsResearchersJournals
Instagram
HomeClubsExplore
June 12, 2024Open Access

Highly Connected Graph Partitioning: Exact Formulation and Solution Methods

View Full Paper
Ask AI
Bookmark
Share

Authors

RSRahul SwamyUniversity of Illinois Urbana-ChampaignDKDouglas M. KingUniversity of Illinois Urbana-ChampaignSJSheldon H. JacobsonUniversity of Illinois Urbana-Champaign

Discussion

Loading...

Member takes

Implication

Key Points

Key points are not available for this paper at this time.

Cite This Study

Swamy et al. (2024) studied this question.

synapsesocial.com/papers/68e651cbb6db6435875e2625https://doi.org/10.48550/arxiv.2406.08329
View Full Paper
Ask AI
Bookmark
Share

Also Consider

Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context:

  1. 1A social network graph partitioning algorithm based on double deep Q-Network2025 · 2 citations
  2. 2Balanced Partitioning for Optimizing Big Graph Computation: Complexities and Approximation Algorithms2024
  3. 3A Greedy Strategy for Graph Cut2026
  4. 4Towards Faster Graph Partitioning via Pre-training and Inductive Inference2024
  5. 5WindGP: Efficient Graph Partitioning on Heterogenous Machines2024 · 1 citations