| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4952149 | Theoretical Computer Science | 2017 | 8 Pages |
Abstract
We present a method to compute such an extension and show that if D is transitively closed, this problem can be solved in the same asymptotic time as computing a transitive reduction of D.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Arne C. Reimers, Alexandra-M. Reimers, Yaron Goldstein,