Acyclicity Constraints

Acyclicity Constraints is a formal computational requirement in the context of Directed Acyclic Graphs that enforces the absence of directed cycles, thereby ensuring that no sequence of directed edges forms a closed loop, distinguishing it from general graph constraints by specifically preserving the acyclic property essential for valid topological ordering and causal inference.

33

Publications

2.6K

Citations

87

Authors

56

Institutions

Publications per year

2017–2026

12

Authors

87

  1. PA
    Pieter Abbeel

    University of California, Berkeley, United States

    2 publications · 762 citations

    2

    h-index

  2. IN
    Ignavier Ng

    Huawei Technologies (China), China

    2 publications · 118 citations

    2

    h-index

  3. DK
    Daphne Koller

    Stanford University, United States

    2 publications · 762 citations

    2

    h-index

  4. IH
    Ian Horrocks

    University of Oxford, United Kingdom

    2 publications · 47 citations

    2

    h-index

  5. MK
    Markus Krötzsch

    Technische Universität Dresden, Germany

    2 publications · 50 citations

    2

    h-index

1–5 of 87

Venues

  1. arXiv (Cornell University)

    Repository · 7 publications · 677 citations

    7

    h-index

  2. HAL (Le Centre pour la Communication Scientifique Directe)

    Repository · 2 publications · 31 citations

    2

    h-index

  3. Proceedings of the Genetic and Evolutionary Computation Conference

    Conference · 1 publications · 16 citations

    1

    h-index

  4. Journal of Differential Geometry

    1 publications · 68 citations

    1

    h-index

  5. SIAM Journal on Computing

    1 publications · 22 citations

    1

    h-index

1–5