J. Cousty, L. Najman, and B. Perret, Constructive Links between Some Morphological Hierarchies on Edge-Weighted Graphs
DOI : 10.1007/978-3-642-38294-9_8
URL : https://hal.archives-ouvertes.fr/hal-00798622

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.

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

F. Meyer and P. Maragos, Morphological scale-space representation with levelings Scale-Space Theories in Computer Vision, LNCS, vol.1682, pp.187-198, 1999.

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

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

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

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

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.31-1362, 2009.
DOI : 10.1109/TPAMI.2008.173
URL : https://hal.archives-ouvertes.fr/hal-00622410

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

F. Meyer and L. Najman, Segmentation, minimum spanning tree and hierarchies Mathematical Morphology: from theory to application, pp.229-261, 2010.

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. Cousty and L. Najman, Incremental Algorithm for Hierarchical Minimum Spanning Forests and Saliency of Watershed Cuts, ISMM 2011. Number 6671, pp.272-283, 2011.
DOI : 10.1007/978-3-642-21569-8_24
URL : https://hal.archives-ouvertes.fr/hal-00622505

J. B. 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

R. 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

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