Hypergraph Enumeration

Hypergraph Enumeration is a combinatorial method that systematically generates and counts all non-isomorphic hypergraphs over a given set of vertices, distinguished by its focus on exhaustively cataloging hypergraph structures according to specified structural constraints and symmetries.

43

Publications

1.3K

Citations

90

Authors

57

Institutions

Publications per year

2017–2026

7

Authors

90

  1. KE
    Khaled Elbassioni

    Max Planck Society, Germany

    4 publications · 133 citations

    4

    h-index

  2. EB
    Endre Boros

    Rutgers, The State University of New Jersey, United States

    3 publications · 103 citations

    3

    h-index

  3. VG
    Vladimir Gurvich

    Rutgers, The State University of New Jersey, United States

    3 publications · 103 citations

    3

    h-index

  4. LK
    Leonid Khachiyan

    Rutgers, The State University of New Jersey, United States

    3 publications · 103 citations

    3

    h-index

  5. CG
    Catherine Greenhill

    UNSW Sydney, Australia

    2 publications · 33 citations

    2

    h-index

1–5 of 90

Venues

  1. Discrete Applied Mathematics

    7 publications · 188 citations

    7

    h-index

  2. Discrete Mathematics

    4 publications · 77 citations

    4

    h-index

  3. COMBINATORICA

    2 publications · 100 citations

    2

    h-index

  4. Graphs and Combinatorics

    2 publications · 95 citations

    2

    h-index

  5. Information Processing Letters

    2 publications · 34 citations

    2

    h-index

1–5