Acyclic Hypergraphs

Acyclic Hypergraphs is a hypergraph in which no sequence of edges forms a cycle, characterized by the existence of a join tree or a tree decomposition that enables efficient computation and satisfies the running intersection property.

424

Publications

14.8K

Citations

695

Authors

387

Institutions

Publications per year

2017–2026

62

Authors

695

  1. ZF
    Zoltán Füredi

    Hungarian Academy of Sciences, Hungary

    7 publications · 187 citations

    7

    h-index

  2. BZ
    Bo Zhou

    South China Normal University, China

    6 publications · 155 citations

    6

    h-index

  3. EG
    Ervin Győri

    Hungarian Academy of Sciences, Hungary

    6 publications · 214 citations

    6

    h-index

  4. AR
    Andrzej Ruciński

    Adam Mickiewicz University in Poznań, Poland

    5 publications · 235 citations

    5

    h-index

  5. ŹT
    Źsolt Tuza

    Hungarian Academy of Sciences, Hungary

    5 publications · 108 citations

    5

    h-index

1–5 of 695

Venues

  1. Journal of Combinatorial Theory Series B

    36 publications · 1.6K citations

    23

    h-index

  2. Discrete Mathematics

    51 publications · 1.8K citations

    19

    h-index

  3. Linear Algebra and its Applications

    24 publications · 828 citations

    18

    h-index

  4. Discrete Applied Mathematics

    32 publications · 854 citations

    17

    h-index

  5. European Journal of Combinatorics

    17 publications · 554 citations

    15

    h-index

1–5