Generating Trees

Generating Trees is a combinatorial framework that systematically encodes the recursive structure of a class of discrete objects through a rooted tree whose nodes represent individual objects and whose edges reflect constructive relationships governed by a finite set of production rules.

105

Publications

5.9K

Citations

179

Authors

122

Institutions

Publications per year

2017–2026

6

Authors

179

  1. FR
    Frank Ruskey

    University of Victoria, Canada

    6 publications · 442 citations

    6

    h-index

  2. JF
    James F. Korsh

    Temple University, United States

    3 publications · 63 citations

    3

    h-index

  3. AF
    Ariel Felner

    Ben-Gurion University of the Negev, Israel

    2 publications · 89 citations

    2

    h-index

  4. GS
    Guni Sharon

    Ben-Gurion University of the Negev, Israel

    2 publications · 89 citations

    2

    h-index

  5. SE
    Sergi Elizalde

    Dartmouth College, United States

    2 publications · 24 citations

    2

    h-index

1–5 of 179

Venues

  1. SIAM Journal on Computing

    9 publications · 690 citations

    9

    h-index

  2. Information Processing Letters

    8 publications · 251 citations

    8

    h-index

  3. Theoretical Computer Science

    6 publications · 656 citations

    6

    h-index

  4. IEEE Transactions on Circuit Theory

    6 publications · 211 citations

    6

    h-index

  5. Discrete Mathematics

    5 publications · 601 citations

    5

    h-index

1–5