Revisiting the Isoperimetric Graph Partitioning Problem
Sign Up to like & getrecommendations! Published in 2019 at "IEEE Access"
DOI: 10.1109/access.2019.2901094
Abstract: Isoperimetric graph partitioning, which is also known as the Cheeger cut, is NP-hard in its original form. In the literature, multiple modifications to this problem have been proposed to obtain approximation algorithms for clustering applications.… read more here.
Keywords: graph partitioning; problem; partitioning problem; graph ... See more keywords