R. 1. Meyer and F. , Minimum Spanning Forests for Morphological Segmentation, pp.77-84, 1994.
DOI : 10.1007/978-94-011-1040-2_11

S. Beucher, Watershed, Hierarchical Segmentation and Waterfall Algorithm, ISMM 94, pp.69-76, 1994.
DOI : 10.1007/978-94-011-1040-2_10

L. Najman and M. Schmitt, Geodesic saliency of watershed contours and hierarchical segmentation, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.18, issue.12, pp.1163-1173, 1996.
DOI : 10.1109/34.546254
URL : https://hal.archives-ouvertes.fr/hal-00622128

F. Meyer, The Dynamics of Minima and Contours, In: ISMM, pp.329-336, 1996.
DOI : 10.1007/978-1-4613-0469-2_38

L. Guigues, J. P. Cocquerez, and H. L. Men, Scale-Sets Image Analysis, International Journal of Computer Vision, vol.20, issue.6, pp.289-317, 2006.
DOI : 10.1007/s11263-005-6299-0
URL : https://hal.archives-ouvertes.fr/hal-00705364

P. A. Arbeláez and L. D. Cohen, A Metric Approach to Vector-Valued Image Segmentation, International Journal of Computer Vision, vol.133, issue.2, pp.119-126, 2006.
DOI : 10.1007/s11263-006-6857-5

F. Meyer and L. Najman, Segmentation, Minimum Spanning Tree and Hierarchies, pp.229-261, 2010.
DOI : 10.1002/9781118600788.ch9
URL : https://hal.archives-ouvertes.fr/hal-00622502

J. Cousty, L. Najman, and J. Serra, Raising in watershed lattices, 2008 15th IEEE International Conference on Image Processing, pp.2196-2199, 2008.
DOI : 10.1109/ICIP.2008.4712225
URL : https://hal.archives-ouvertes.fr/hal-00622472

L. Najman, On the Equivalence Between Hierarchical Segmentations and??Ultrametric Watersheds, Journal of Mathematical Imaging and Vision, vol.113, issue.3, pp.231-247, 2011.
DOI : 10.1007/s10851-011-0259-1
URL : https://hal.archives-ouvertes.fr/hal-00419373

J. Gower and G. Ross, Minimum Spanning Trees and Single Linkage Cluster Analysis, Applied Statistics, vol.18, issue.1, pp.54-64, 1969.
DOI : 10.2307/2346439

C. Zahn, Graph-theoretical methods for detecting and descibing gestalt clusters, IEEE Transactions on Computers C, vol.20, issue.1, pp.99-112, 1971.

O. J. Morris, M. D. Lee, and A. G. Constantinides, Graph theory for image analysis: an approach based on the shortest spanning tree, IEE Proceedings F Communications, Radar and Signal Processing, vol.133, issue.2, pp.146-152, 1986.
DOI : 10.1049/ip-f-1.1986.0025

P. Felzenszwalb and D. Huttenlocher, Efficient Graph-Based Image Segmentation, International Journal of Computer Vision, vol.59, issue.2, pp.167-181, 2004.
DOI : 10.1023/B:VISI.0000022288.19776.77

B. Marcotegui and S. Beucher, Fast Implementation of Waterfall Based on Graphs, ISMM 2005, pp.177-186, 2005.
DOI : 10.1007/1-4020-3443-1_16

L. Najman, M. Couprie, and G. Bertrand, Watersheds, mosaics, and the emergence paradigm, Discrete Applied Mathematics, vol.147, issue.2-3, pp.301-324, 2005.
DOI : 10.1016/j.dam.2004.09.017
URL : https://hal.archives-ouvertes.fr/hal-00622113

J. Cousty, G. Bertrand, L. Najman, and M. Couprie, Watershed Cuts: Minimum Spanning Forests and the Drop of Water Principle, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.31, issue.8, pp.1362-1374, 2009.
DOI : 10.1109/TPAMI.2008.173
URL : https://hal.archives-ouvertes.fr/hal-00622410

J. Cousty, L. Najman, and J. Serra, Some Morphological Operators in Graph Spaces, Number LNCS, vol.29, issue.10, pp.149-160, 2009.
DOI : 10.1016/j.patrec.2008.03.019
URL : https://hal.archives-ouvertes.fr/hal-00622403

P. Salembier, A. Oliveras, and L. Garrido, Anti-extensive connected operators for image and sequence processing, IEEE TIP, vol.7, issue.4, pp.555-570, 1998.

L. Najman and M. Couprie, Building the Component Tree in Quasi-Linear Time, IEEE Transactions on Image Processing, vol.15, issue.11, pp.3531-3539, 2006.
DOI : 10.1109/TIP.2006.877518
URL : https://hal.archives-ouvertes.fr/hal-00622110

J. Cousty, G. Bertrand, L. Najman, and M. Couprie, Watershed Cuts: Thinnings, Shortest Path Forests, and Topological Watersheds, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.32, issue.5, pp.925-939, 2010.
DOI : 10.1109/TPAMI.2009.71
URL : https://hal.archives-ouvertes.fr/hal-00729346

C. Couprie, L. Grady, L. Najman, and H. Talbot, Power Watershed: A Unifying Graph-Based Optimization Framework, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.33, issue.7, 2010.
DOI : 10.1109/TPAMI.2010.200

R. Audigier and R. Lotufo, Seed-Relative Segmentation Robustness of Watershed and Fuzzy Connectedness Approaches, XX Brazilian Symposium on Computer Graphics and Image Processing (SIBGRAPI 2007), pp.61-70, 2007.
DOI : 10.1109/SIBGRAPI.2007.26

R. E. Tarjan, Efficiency of a Good But Not Linear Set Union Algorithm, Journal of the ACM, vol.22, issue.2, pp.215-225, 1975.
DOI : 10.1145/321879.321884

M. L. Fredman and R. E. Tarjan, Fibonacci heaps and their uses in improved network optimization algorithms, Journal of the ACM, vol.34, issue.3, pp.596-615, 1987.
DOI : 10.1145/28869.28874

M. Couprie, L. Najman, and G. Bertrand, Quasi-Linear Algorithms for the Topological Watershed, Journal of Mathematical Imaging and Vision, vol.13, issue.6, pp.231-249, 2005.
DOI : 10.1007/s10851-005-4892-4
URL : https://hal.archives-ouvertes.fr/hal-00622399

M. Bender and M. Farach-colton, The LCA Problem Revisited, pp.88-94, 2000.
DOI : 10.1007/10719839_9

C. Vachier and F. Meyer, Extinction value: a new measurement of persistence, IEEE Workshop on Nonlinear Signal and Image Processing, pp.254-257, 1995.

S. Philipp-foliguet, M. Jordan, L. Najman, and J. Cousty, Artwork 3D model database indexing and classification, Pattern Recognition, vol.44, issue.3, pp.588-597, 2011.
DOI : 10.1016/j.patcog.2010.09.016
URL : https://hal.archives-ouvertes.fr/hal-00538470

C. Alì-ene, J. Y. Audibert, M. Couprie, and R. Keriven, Some links between extremum spanning forests, watersheds and min-cuts, Image and Vision Computing, vol.28, issue.10, pp.1460-1471, 2010.
DOI : 10.1016/j.imavis.2009.06.017