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
Parents
424
Normal hypergraphs and the perfect graph conjecture
László Lovász · Discrete Mathematics · 1972 · 762 citations
1–5 of 424
695
7
h-index
6
h-index
6
h-index
5
h-index
5
h-index
1–5 of 695
387

Alfréd Rényi Institute of Mathematics
Budapest, Hungary
15 h-index
21 publications
649 citations

Hungarian Academy of Sciences
Budapest, Hungary
13 h-index
23 publications
587 citations

Centre National de la Recherche Scientifique
Paris, France
11 h-index
23 publications
956 citations
University of Illinois Urbana-Champaign
Urbana, United States
10 h-index
16 publications
672 citations

Tel Aviv University
Tel Aviv, Israel
9 h-index
12 publications
426 citations
Rutgers, The State University of New Jersey
New Brunswick, United States
8 h-index
12 publications
423 citations
Carnegie Mellon University
Pittsburgh, United States
8 h-index
11 publications
275 citations

University of Waterloo
Waterloo, Canada
8 h-index
9 publications
305 citations
1–8 of 387
36 publications · 1.6K citations
23
h-index
51 publications · 1.8K citations
19
h-index
24 publications · 828 citations
18
h-index
32 publications · 854 citations
17
h-index
17 publications · 554 citations
15
h-index
1–5