V. E. Alekseev, R. Boliac, D. V. Korobitsyn, V. V. Lozin, ]. S. Alpert et al., NP-hard graph problems and boundary classes of graphs, Proceedings of the IEEE Conference on Computer Vision and 572 Pattern Recognition, pp.219-236, 2007.
DOI : 10.1016/j.tcs.2007.09.013
URL : https://doi.org/10.1016/j.tcs.2007.09.013

K. Bernhard and J. Vygen, Combinatorial optimization: Theory and algorithms, Third 576 Edition, 2005.

X. Bresson, X. Tai, T. F. Chan, A. Szlam, A. Challa et al., An introduction to Gamma-convergence for 581 spectral clustering, in Discrete Geometry for Computer Imagery -20th IAPR International Conference3-319-66272-5 16, https://doi.org/10.1007/978-3-319-66272-5 16 Power Spectral Clustering. working 586 paper or preprint An introduction to Total 588 Variation for image analysis, Theoretical foundations and numerical methods for sparse recovery The 1-Laplacian Cheeger cut: Theory and algorithms Spectral Graph Theory Power watershed: A unifying graph-based 594 optimization framework Watershed cuts: Minimum spanning forests 597 and the drop of water principle, Multi-class transductive learning based on 1 578 relaxations of Cheeger cut and Mumford-Shah-Potts model Proceedings13] J. Cousty, G. Bertrand, L. Najman, and M. Couprie, Watershed cuts: Thinnings, shortest path 600 forests, and topological watersheds S. Danda, A. Challa, B. S. D. Sagar, and L. Najman, Power tree filter: A theoretical frame- 603 work linking shortest path filters and minimum spanning tree filters Mathematical Morphology 604 and Its Applications to Signal and Image Processing -13th International Symposium, ISMM 2017, pp.49-191, 1997.

F. Fontainebleau, J. Proceedings, S. Angulo, F. Velasco-forero, . S. Meyer et al., Some Theoretical Links Between 609 Shortest Path Filters and Minimum Spanning Tree Filters. working paper or preprint A proof of the gilbert-pollak conjecture on the steiner ratio [19] L. Grady, Fast, quality, segmentation of large volumes -isoperimetric distance trees Isoperimetric graph partitioning for image segmentation, Steiner minimal trees Graph and nonlocal framework Nonlinear Eigenproblems in Image Processing and Com- 616 puter Vision Computer 618 Vision -ECCV 2006, 9th European Conference on Computer Vision of Lecture 620 Notes in Computer Science, pp.199-210, 1007.

P. Anal, L. Mach, E. L. Grady, and . Schwartz, Isoperimetric partitioning: A new algorithm for graph partitioning, Intell, vol.28, pp.469-475, 2006.

S. J. Scientific-computing, L. Guigues, J. P. Cocquerez, H. Le-men, L. Hubert et al., Scale-sets image analysis, International Journal of 629 Computer Vision Comparing partitions Modified Cheeger and ratio cut methods 633 using the Ginzburg?Landau functional for classification of high-dimensional data, Inverse Problems Isoperimetric numbers of graphs Variational methods in image segmentation: with seven image processing 638 experiments Pont-Tuset and F. Marqués, Supervised evaluation of image segmentation and object proposal 643 techniques Information theoretic measures for clusterings comparison: Vari- 646 ants, properties, normalization and correction for chance, p. 074003. 635 [25] B. Mohar Science & Business Media, 2012. 639 [27] L. Najman, Extending the power watershed framework thanks to ?-convergence, SIAM J. Imaging 640 Sciences31] Y. Xu, E. Carlinet, T. Géraud, and L. Najman, Hierarchical segmentation using tree-based shape 650 spaces, IEEE transactions on pattern analysis and machine intelligence, pp.1844-1866, 1016.