One Edge at a Time: A Novel Approach Towards Efficient Transitive Reduction Computation on DAGs
Given a directed acyclic graph (DAG) G, G's transitive reduction (TR) G<sup>tr</sup> is the unique DAG satisfying that G<sup>tr</sup> has the minimum number of edges and has the same transitive closure (TC) as G. TR computation has been extensively studied during the pas...
| Main Authors: | , , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
IEEE
2020-01-01
|
| Series: | IEEE Access |
| Subjects: | |
| Online Access: | https://ieeexplore.ieee.org/document/9006804/ |