| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4653041 | Electronic Notes in Discrete Mathematics | 2006 | 6 Pages |
Abstract
We present a simple algorithm which maintains the topological order of a directed acyclic graph with n nodes under an online edge insertion sequence in O(n2.75) time, independent of the number of edges m inserted. For dense DAGs, this is an improvement over the previous best result of Katriel and Bodlaender.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
