G. Matheron, Eléments pour une théorie des milieux poreux, 1967.

F. Meyer and P. Maragos, Nonlinear Scale-Space Representation with Morphological Levelings, Journal of Visual Communication and Image Representation, vol.11, issue.2, pp.245-265, 2000.
DOI : 10.1006/jvci.1999.0447

R. Cormack, A Review of Classification, Journal of the Royal Statistical Society. Series A (General), vol.134, issue.3, pp.321-367, 1971.
DOI : 10.2307/2344237

G. Estabrook, A mathematical model in graph theory for biological classification, Journal of Theoretical Biology, vol.12, issue.3, pp.297-310, 1966.
DOI : 10.1016/0022-5193(66)90144-5

D. Matula, Cluster analysis via graph theoretic techniques, Proc. Louisiana Conference on Combinatorics, Graph Theory, and Computing, pp.199-212, 1970.
DOI : 10.1002/9781118445112.stat02447

C. Zahn, Graph-Theoretical Methods for Detecting and Describing Gestalt Clusters, IEEE Transactions on Computers, vol.20, issue.1, pp.68-86, 1971.
DOI : 10.1109/T-C.1971.223083

L. Hubert, Some applications of graph theory to clustering, Psychometrika, vol.20, issue.3, pp.283-309, 1974.
DOI : 10.1007/BF02291704

L. Hubert, Min and max hierarchical clustering using asymmetric similarity measures, Psychometrika, vol.15, issue.1, pp.63-72, 1973.
DOI : 10.1007/BF02291174

R. Diestel, Graph Theory. Graduate Texts in Mathematics, 1997.

T. Kong and A. Rosenfeld, Digital Topology, Image Process, vol.48, issue.3, pp.357-393, 1989.
DOI : 10.1007/978-1-4615-1529-6_3

S. Jones and K. , Some thoughts on classification for retrieval, Journal of Documentation, vol.26, issue.2, pp.571-581, 1970.

N. Jardine and R. Sibson, A model for taxonomy, Mathematical Biosciences, vol.2, issue.3-4, pp.3-4, 1968.
DOI : 10.1016/0025-5564(68)90030-8

B. Barth?a-c-lemy, J. P. Brucker, F. Osswald, and C. , Combinatorial optimization and hierarchical classifications, Quarterly Journal of the Belgian, French and Italian Operations Research Societies, vol.2, issue.3, pp.179-219, 2004.
DOI : 10.1007/s10288-004-0051-9

S. Johnson, Hierarchical clustering schemes, Psychometrika, vol.58, issue.4, pp.241-254, 1967.
DOI : 10.1007/BF02289588

R. Sokal and P. Sneath, Principles of Numerical Taxonomy, 1963.

P. Sneath, The Application of Computers to Taxonomy, Microbiology, vol.17, issue.1, pp.201-226, 1957.
DOI : 10.1099/00221287-17-1-201

J. Hartigan, Representation of Similarity Matrices by Trees, Journal of the American Statistical Association, vol.33, issue.320, pp.1140-1158, 1967.
DOI : 10.1080/01621459.1967.10500922

C. Jardine, N. Jardine, and R. Sibson, The structure and construction of taxonomic hierarchies, Mathematical Biosciences, vol.1, issue.2, pp.173-179, 1967.
DOI : 10.1016/0025-5564(67)90032-6

B. Benz?a-c-cri and J. P. , L'analyse des données, 1973.

T. Sørensen, A method of establishing groups of equal amplitude in plant sociology based on similarity of species content and its applications to analyses of the vegetation of Danish commons, Biologiske Skrifter, vol.5, issue.4, pp.1-34, 1948.

K. Florek, J. Lukaszewicz, J. Perkal, H. Steinhaus, and S. Zubrzycki, Sur la liaison et la division des points d'un ensemble fini, Colloquium Mathematicum, vol.2, pp.282-285, 1951.

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

J. Kruskal, On the shortest spanning subtree of a graph and the traveling salesman problem, Proceedings of the American Mathematical Society, vol.7, issue.1, pp.48-50, 1956.
DOI : 10.1090/S0002-9939-1956-0078686-7

O. Boruvka, O jistém problému minimálním [On a certain minimal problem], Acta Societatis Scientiarum Naturalium Moravicae III, issue.3, pp.37-58, 1926.

R. Graham and P. Hell, On the History of the Minimum Spanning Tree Problem, IEEE Annals of the History of Computing, vol.7, issue.1, pp.43-57, 1985.
DOI : 10.1109/MAHC.1985.10011

D. Wishart, Mode analysis: a generalization of nearest neighour which reduced chain effect, pp.282-311, 1968.

N. Jardine and R. Sibson, The Construction of Hierarchic and Non-Hierarchic Classifications, The Computer Journal, vol.11, issue.2, pp.177-184, 1968.
DOI : 10.1093/comjnl/11.2.177

S. Horowitz and T. Pavlidis, Picture segmentation by a directed split-and-merge procedure, Proc. Second Int. Joint Conf. Pattern Recognition, pp.424-433, 1974.

S. Zucker, Region growing: Childhood and adolescence, Computer Graphics and Image Processing, vol.5, issue.3, pp.382-399, 1976.
DOI : 10.1016/S0146-664X(76)80014-7

A. Rosenfeld, Fuzzy digital topology, Information and Control, vol.40, issue.1, pp.76-87, 1979.
DOI : 10.1016/S0019-9958(79)90353-X

P. Soille, Morphological partitioning of multispectral images, Journal of Electronic Imaging, vol.5, issue.3, pp.252-265, 1996.
DOI : 10.1117/12.240258

N. Ahuja, On detection and representation of multiscale low-level image structure, ACM Computing Surveys, vol.27, issue.3, pp.304-306, 1995.
DOI : 10.1145/212094.212099

J. Serra, A Lattice Approach to Image Segmentation, Journal of Mathematical Imaging and Vision, vol.2, issue.2, pp.83-130, 2006.
DOI : 10.1007/s10851-005-3616-0
URL : https://hal.archives-ouvertes.fr/hal-00622192

C. Ronse, Partial Partitions, Partial Connections and Connective Segmentation, Journal of Mathematical Imaging and Vision, vol.25, issue.4, pp.97-105, 2008.
DOI : 10.1007/s10851-008-0090-5

P. Soille, Constrained connectivity for hierarchical image partitioning and simplification, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.30, issue.7, pp.1132-1145, 2008.
DOI : 10.1109/TPAMI.2007.70817
URL : http://publications.jrc.ec.europa.eu/repository/handle/JRC36392

S. Horowitz and T. Pavlidis, Picture Segmentation by a Tree Traversal Algorithm, Journal of the ACM, vol.23, issue.2, pp.368-388, 1976.
DOI : 10.1145/321941.321956

M. Nagao, T. Matsuyama, and Y. Ikeda, Region extraction and shape analysis in aerial photographs, Computer Graphics and Image Processing, vol.10, issue.3, pp.195-223, 1979.
DOI : 10.1016/0146-664X(79)90001-7

M. Nagao and T. Matsuyama, A Structural Analysis of Complex Aerial Photographs, 1980.
DOI : 10.1007/978-1-4615-8294-6

A. Baraldi and F. Parmiggiani, Single linkage region growing algorithms based on the vector degree of match, IEEE Transactions on Geoscience and Remote Sensing, vol.34, issue.1, pp.137-148, 1996.
DOI : 10.1109/36.481899

O. Morris, M. Lee, and A. 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

F. Meyer and P. Maragos, Morphological Scale-Space Representation with Levelings, Lecture Notes in Computer Science, vol.1682, pp.187-198, 1999.
DOI : 10.1007/3-540-48236-9_17

P. Nacken, Image segmentation by connectivity preserving relinking in hierarchical graph structures, Pattern Recognition, vol.28, issue.6, pp.907-920, 1995.
DOI : 10.1016/0031-3203(94)00172-I

W. Kropatsch and Y. Haxhimusa, Grouping and segmentation in a hierarchy of graphs, Computational Imaging II, pp.193-204, 2004.
DOI : 10.1117/12.543421

P. Felzenszwalb and D. Huttenlocher, Image segmentation using local variation, Proceedings. 1998 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (Cat. No.98CB36231), pp.98-104, 1998.
DOI : 10.1109/CVPR.1998.698594
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.41.1876

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

Z. Wu and R. Leahy, An optimal graph theoretic approach to data clustering: theory and its application to image segmentation, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.15, issue.11, pp.1101-1113, 1993.
DOI : 10.1109/34.244673

J. Shi and J. Malik, Normalized cuts and image segmentation, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.22, issue.8, pp.888-905, 2000.

R. Marfil, L. Molina-tanco, A. Bandera, J. Rodriguez, and F. Sandoval, Pyramid segmentation algorithms revisited, Pattern Recognition, vol.39, issue.8, pp.1430-1451, 2006.
DOI : 10.1016/j.patcog.2006.02.017

W. G. Kropatsch, Y. Haxhimusa, and A. Ion, Multiresolution Image Segmentations in Graph Pyramids, Studies in Computational Intelligence, vol.52, pp.3-41, 2007.
DOI : 10.1007/978-3-540-68020-8_1

L. Guigues, H. Le-men, and J. P. Cocquerez, The hierarchy of the cocoons of a graph and its application to image segmentation, Pattern Recognition Letters, vol.24, issue.8, pp.1059-1066, 2003.
DOI : 10.1016/S0167-8655(02)00252-0
URL : https://hal.archives-ouvertes.fr/hal-00706166

L. Guigues, J. P. Cocquerez, and H. Le-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

A. Arbel?a¡ez, P. Cohen, and L. , Energy Partitions and Image Segmentation, Journal of Mathematical Imaging and Vision, vol.20, issue.1/2, pp.43-57, 2004.
DOI : 10.1023/B:JMIV.0000011318.77653.44

A. Arbel?a¡ez and P. , Boundary extraction in natural images using ultrametric contour maps, Proc. of Computer Vision and Pattern Recognition Workshop, 2006.

S. Beucher, Segmentation d'images et morphologie mathématique, 1990.

S. Beucher, Watershed, Hierarchical Segmentation and Waterfall Algorithm, Mathematical Morphology and its Applications to Image Processing, pp.69-76, 1994.
DOI : 10.1007/978-94-011-1040-2_10

S. Beucher and F. Meyer, The morphological approach to segmentation: the watershed transformation, Mathematical Morphology in Image Processing, pp.433-481, 1993.

L. Vincent and P. Soille, Watersheds in digital spaces: an efficient algorithm based on immersion simulations, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.13, issue.6, pp.583-598, 1991.
DOI : 10.1109/34.87344

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

J. Cousty and L. Najman, Incremental Algorithm for Hierarchical Minimum Spanning Forests and Saliency of Watershed Cuts, 10th International Symposium on Mathematical Morphology (ISMM'11), 2011.
DOI : 10.1007/978-3-642-21569-8_24
URL : https://hal.archives-ouvertes.fr/hal-00622505

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

F. Meyer, Minimum Spanning Forests for Morphological Segmentation, Mathematical Morphology and its Applications to Image Processing, pp.77-84, 1994.
DOI : 10.1007/978-94-011-1040-2_11

P. Salembier and L. Garrido, Binary partition tree as an efficient representation for image processing, segmentation, and information retrieval, IEEE Transactions on Image Processing, vol.9, issue.4, pp.561-576, 2000.
DOI : 10.1109/83.841934

R. Jones, Component trees for image filtering and segmentation, Proc. of IEEE Workshop on Nonlinear Signal and Image Processing, 1997.

R. Jones, Connected Filtering and Segmentation Using Component Trees, Computer Vision and Image Understanding, vol.75, issue.3, pp.215-228, 1999.
DOI : 10.1006/cviu.1999.0777

P. Salembier, A. Oliveras, and L. Garrido, Antiextensive connected operators for image and sequence processing, IEEE Transactions on Image Processing, vol.7, issue.4, pp.555-570, 1998.
DOI : 10.1109/83.663500
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.55.9217

F. Meyer, AN OVERVIEW OF MORPHOLOGICAL SEGMENTATION, International Journal of Pattern Recognition and Artificial Intelligence, vol.15, issue.07, pp.1089-1118, 2001.
DOI : 10.1142/S0218001401001337

F. Meyer and L. Najman, Segmentation, Minimum Spanning Tree and Hierarchies, Mathematical morphology: from theory to applications, pp.255-287, 2010.
DOI : 10.1002/9781118600788.ch9
URL : https://hal.archives-ouvertes.fr/hal-00622502

P. Salembier and M. Wilkinson, Connected operators, IEEE Signal Processing Magazine, vol.26, issue.6, pp.136-157, 2009.
DOI : 10.1109/MSP.2009.934154

P. Salembier, Connected operators based on region-tree pruning strategies, Proceedings 15th International Conference on Pattern Recognition. ICPR-2000, pp.205-221, 2010.
DOI : 10.1109/ICPR.2000.903561

P. Soille, On Genuine Connectivity Relations Based on Logical Predicates, 14th International Conference on Image Analysis and Processing (ICIAP 2007), pp.487-492, 2007.
DOI : 10.1109/ICIAP.2007.4362825

P. Soille, Preventing Chaining through Transitions While Favouring It within Homogeneous Regions, Lecture Notes in Computer Science, vol.6671, pp.96-107, 2011.
DOI : 10.1007/978-3-642-21569-8_9
URL : http://publications.jrc.ec.europa.eu/repository/handle/JRC61899

L. Gueguen and P. Soille, Frequent and Dependent Connectivities, Lecture Notes in Computer Science, vol.6671, pp.120-131, 2011.
DOI : 10.1007/978-3-642-21569-8_11
URL : http://publications.jrc.ec.europa.eu/repository/handle/JRC64316

P. Soille, Advances in the Analysis of Topographic Features on Discrete Images, Lecture Notes in Computer Science, vol.2301, pp.175-186, 2002.
DOI : 10.1007/3-540-45986-3_16

P. Soille and J. Grazzini, Constrained Connectivity and Transition Regions, Lecture Notes in Computer Science, vol.42, pp.59-69, 2009.
DOI : 10.1016/j.patcog.2008.11.004
URL : https://commerce.metapress.com/content/g6h8mk8447041532/resource-secured/?target=fulltext.pdf&sid=iiot13nznlhqylrqczxwal55&sh=www.springerlink.com

P. Soille and L. Vincent, Determining watersheds in digital pictures via flooding simulations, Visual Communications and Image Processing'90, pp.240-250, 1990.

G. Ouzounis and P. Soille, Pattern Spectra from Partition Pyramids and Hierarchies, Lecture Notes in Computer Science, vol.6671, pp.108-119, 2011.
DOI : 10.1007/978-3-642-21569-8_10

G. Ouzounis and P. Soille, Attribute-constrained connectivity and alpha-tree representation, IEEE Transactions on Image Processing, 2011.

P. Soille, Constrained connectivity for the processing of very-high-resolution satellite images, International Journal of Remote Sensing, vol.31, issue.22, pp.5879-5893, 2010.
DOI : 10.1109/TGRS.2002.804618

L. Najman, Ultrametric Watersheds, Proc. ISMM 2009, pp.181-192, 2009.
DOI : 10.1007/s10851-005-4892-4
URL : https://hal.archives-ouvertes.fr/hal-00622405

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

G. Bertrand, On Topological Watersheds, Journal of Mathematical Imaging and Vision, vol.34, issue.6, pp.217-230, 2005.
DOI : 10.1007/s10851-005-4891-5
URL : https://hal.archives-ouvertes.fr/hal-00622398

J. Cousty and L. Najman, Incremental Algorithm for Hierarchical Minimum Spanning Forests and Saliency of Watershed Cuts, Proc. of ISMM 2011, pp.271-283, 2011.
DOI : 10.1007/978-3-642-21569-8_24
URL : https://hal.archives-ouvertes.fr/hal-00622505

C. Mattiussi, The finite volume, finite element, and finite difference methods as numerical methods for physical field problems, Advances in Imaging and Electron Physics, vol.113, pp.1-146, 2000.
DOI : 10.1016/S1076-5670(00)80012-9

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

E. Breen and R. Jones, Attribute Openings, Thinnings, and Granulometries, Computer Vision and Image Understanding, vol.64, issue.3, pp.377-389, 1996.
DOI : 10.1006/cviu.1996.0066

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

R. Adams and L. Bischof, Seeded region growing, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.16, issue.6, pp.641-647, 1994.
DOI : 10.1109/34.295913

L. Hubert, Some extensions of Johnson's hierarchical clustering algorithms, Psychometrika, vol.27, issue.3, pp.261-274, 1972.
DOI : 10.1007/BF02306783

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

J. Cousty, L. Najman, and J. Serra, Some Morphological Operators in Graph Spaces, 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

F. Dias, J. Cousty, and L. Najman, Some Morphological Operators on Simplicial Complex Spaces, 16th Discrete Geometry for Computer Imagery (DGCI'11, pp.441-452, 2011.
DOI : 10.1007/978-3-642-19867-0_37
URL : https://hal.archives-ouvertes.fr/hal-00730470

R. Levillain, T. Géraud, and L. Najman, Writing Reusable Digital Topology Algorithms in a Generic Image Processing Framework, Lecture Notes in Computer Science, 2012.
DOI : 10.1007/978-3-642-32313-3_10