Revisiting the Isoperimetric Graph Partitioning Problem
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. In the context of image segmentation, a heuristic co...
Main Authors: | Sravan Danda, Aditya Challa, B. S. Daya Sagar, Laurent Najman |
---|---|
Format: | Article |
Language: | English |
Published: |
IEEE
2019-01-01
|
Series: | IEEE Access |
Subjects: | |
Online Access: | https://ieeexplore.ieee.org/document/8694009/ |
Similar Items
-
Isoperimetric Inequalities in Unbounded Convex Bodies
by: Leonardi, G.P, et al.
Published: (2022) -
Bonnesen-style inequality for the first eigenvalue on a complete surface of constant curvature
by: Niufa Fang, et al.
Published: (2017-08-01) -
Isoperimetric Regions in Rn with Density rp
by: Boyer Wyatt, et al.
Published: (2016-09-01) -
Bonnesen-style Wulff isoperimetric inequality
by: Zengle Zhang, et al.
Published: (2017-02-01) -
Isoperimetric Numbers of Randomly Perturbed Intersection Graphs
by: Yilun Shang
Published: (2019-04-01)