Tree-based Representation

Tree-Based Representation is a data structure organization method in which each disjoint set is implemented as a tree, where nodes represent elements and parent-child relationships define set membership and connectivity through union and find operations.

819

Publications

43.9K

Citations

2.2K

Authors

923

Institutions

Publications per year

2017–2026

239

Authors

2.2K

  1. MZ
    Mengjie Zhang

    Victoria University of Wellington, New Zealand

    7 publications · 405 citations

    7

    h-index

  2. TG
    Thierry Géraud

    École Pour l'Informatique et les Techniques Avancées, France

    6 publications · 239 citations

    6

    h-index

  3. HZ
    Heping Zhang

    Yale University, United States

    6 publications · 214 citations

    6

    h-index

  4. BX
    Bing Xue

    Victoria University of Wellington, New Zealand

    6 publications · 385 citations

    6

    h-index

  5. PS
    Philippe Salembier

    Universitat Politècnica de Catalunya, Spain

    6 publications · 920 citations

    6

    h-index

1–5 of 2.2K

Venues

  1. arXiv (Cornell University)

    Repository · 21 publications · 732 citations

    15

    h-index

  2. IEEE Transactions on Image Processing

    8 publications · 901 citations

    8

    h-index

  3. Theoretical Computer Science

    8 publications · 252 citations

    8

    h-index

  4. Bioinformatics

    8 publications · 241 citations

    8

    h-index

  5. International Journal of Production Research

    8 publications · 335 citations

    8

    h-index

1–5