L. Vincent, Grayscale area openings and closings, their efficient implementation and applications, Proc. of EURASIP Workshop on Mathematical Morphology and its Applications to Signal Processing, pp.22-27, 1993.
DOI : 10.1007/978-3-662-03039-4_13

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.125.6317

P. Salembier and J. Serra, Flat zones filtering, connected operators, and filters by reconstruction, IEEE Transactions on Image Processing, vol.4, issue.8, pp.1153-1160, 1995.
DOI : 10.1109/83.403422

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.17.9460

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

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

J. Hernández and B. Marcotegui, Shape ultimate attribute opening, Image and Vision Computing, vol.29, issue.8, pp.533-545, 2011.
DOI : 10.1016/j.imavis.2011.05.001

E. R. Urbach and M. H. Wilkinson, Shape-only granulometries and grey-scale shape filters, Mathematical Morphology and Its Applications to Signal and Image Processing (Proceedings of ISMM), pp.305-314, 2002.

G. K. Ouzounis and M. H. Wilkinson, Mask-Based Second-Generation Connectivity and Attribute Filters, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.29, issue.6, pp.990-1004, 2007.
DOI : 10.1109/TPAMI.2007.1045

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.151.1314

P. Monasse and F. Guichard, Fast computation of a contrast-invariant image representation, IEEE Transactions on Image Processing, vol.9, issue.5, pp.860-872, 2000.
DOI : 10.1109/83.841532

Y. Xu, T. Géraud, and L. Najman, Morphological filtering in shape spaces: Applications using tree-based image representations, Proc. of International Conference on Pattern Recognition, pp.485-488, 2012.
DOI : 10.1109/tpami.2015.2441070

URL : https://hal.archives-ouvertes.fr/hal-00714847

J. Matas, O. Chum, M. Urban, and T. Pajdla, Robust wide-baseline stereo from maximally stable extremal regions, Image and Vision Computing, vol.22, issue.10, pp.761-767, 2004.
DOI : 10.1016/j.imavis.2004.02.006

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.671.8241

M. A. Westenberg, J. B. Roerdink, and M. H. Wilkinson, Volumetric Attribute Filtering and Interactive Visualization Using the Max-Tree Representation, IEEE Transactions on Image Processing, vol.16, issue.12, pp.2943-2952, 2007.
DOI : 10.1109/TIP.2007.909317

C. Berger, T. Géraud, R. Levillain, N. Widynski, A. Baillard et al., Effective Component Tree Computation with Application to Pattern Recognition in Astronomical Imaging, 2007 IEEE International Conference on Image Processing, p.41, 2007.
DOI : 10.1109/ICIP.2007.4379949

B. Perret, S. Lefèvre, C. Collet, and . Slezak, Connected Component Trees for Multivariate Image Processing and Applications in Astronomy, 2010 20th International Conference on Pattern Recognition, pp.4089-4092, 2010.
DOI : 10.1109/ICPR.2010.994

E. Carlinet and T. Géraud, A comparison of many maxtree computation algorithms, Mathematical Morphology and Its Applications to Signal and Image Processing (Proceedings of ISMM), ser. Lecture Notes on Computer Science, pp.73-85, 2013.

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

M. H. Wilkinson and M. A. Westenberg, Shape Preserving Filament Enhancement Filtering, Proc. of Medical Image Computing and Computer-Assisted Intervention, pp.770-777, 2001.
DOI : 10.1007/3-540-45468-3_92

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.150.9361

M. H. Wilkinson, H. Gao, W. H. Hesselink, J. E. Jonker, and A. Meijster, Concurrent Computation of Attribute Filters on Shared Memory Parallel Machines, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.30, issue.10, pp.1800-1813, 2008.
DOI : 10.1109/TPAMI.2007.70836

A. V. Aho, J. D. Ullman, and J. E. Hopcroft, Data Structures and Algorithms, 1983.

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. H. Wilkinson, A fast component-tree algorithm for high dynamic-range images and second generation connectivity, 2011 18th IEEE International Conference on Image Processing, pp.1021-1024, 2011.
DOI : 10.1109/ICIP.2011.6115597

G. K. Ouzounis and M. H. Wilkinson, A parallel implementation of the dual-input max-tree algorithm for attribute filtering, Mathematical Morphology and Its Applications to Signal and Image Processing (Proceedings of ISMM), pp.449-460, 2007.

P. Matas, E. Dokladalova, M. Akil, T. Grandpierre, L. Najman et al., Parallel Algorithm for Concurrent Computation of Connected Component Tree, Advanced Concepts for Intelligent Vision Systems, pp.230-241, 2008.
DOI : 10.1007/3-540-44438-6_32

URL : https://hal.archives-ouvertes.fr/hal-00622406

D. Menotti, L. Najman, A. De-albuquerque, and . Araújo, 1D component tree in linear time and space and its application to gray-level image multithresholding, Mathematical Morphology and Its Apps. to Signal and Image Processing (Proc. of ISMM), pp.437-448, 2007.
URL : https://hal.archives-ouvertes.fr/hal-00622373

V. Morard, P. Dokládal, and E. Decenciere, One-Dimensional Openings, Granulometries and Component Trees in <formula formulatype="inline"><tex Notation="TeX">${\cal O}(1)$</tex> </formula> Per Pixel, IEEE Journal of Selected Topics in Signal Processing, vol.6, issue.7, pp.840-848, 2012.
DOI : 10.1109/JSTSP.2012.2201694

A. Andersson, T. Hagerup, S. Nilsson, and R. Raman, Sorting in linear time, Proc. of the Annual ACM symposium on Theory of computing, pp.427-436, 1995.
DOI : 10.1145/225058.225173

D. Nistér and H. Stewénius, Linear Time Maximally Stable Extremal Regions, Proc. of European Conference on Computer Vision, pp.183-196, 2008.
DOI : 10.1007/978-3-540-88688-4_14

W. H. Hesselink, Salembier's Min-tree algorithm turned into breadth first search, Information Processing Letters, vol.88, issue.5, pp.225-229, 2003.
DOI : 10.1016/j.ipl.2003.08.003

J. Reinders, Intel Threading Building Blocks: outfitting C++ for multi-core processor parallelism. O'Reilly Media, 2007.

D. E. Willard, Log-logarithmic worst-case range queries are possible in space ??(N), Information Processing Letters, vol.17, issue.2, pp.81-84, 1983.
DOI : 10.1016/0020-0190(83)90075-3

T. Géraud, E. Carlinet, S. Crozet, and L. Najman, A Quasi-linear Algorithm to Compute the Tree of Shapes of nD Images, Mathematical Morphology and Its Applications to Signal and Image Processing (Proceedings of ISMM), ser. Lecture Notes on Computer Science, pp.98-110, 2013.
DOI : 10.1007/978-3-642-38294-9_9

L. Najman, J. Cousty, and B. Perret, Playing with Kruskal: Algorithms for morphological trees in edgeweighted graphs, Mathematical Morphology and Its Applications to Signal and Image Processing (Proceedings of ISMM), ser. Lecture Notes on Computer Science, pp.135-146, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00798621